On the enumeration of connected sets in finite cylindrical lattice graphs

Documenti analoghi

• The burning number conjecture holds for trees of order $n$ with at most $\left\lfloor \sqrt{n-1}\right\rfloor$ degree-2 vertices
  di: Ning, Jiajun, et al.
  Pubblicazione: (2025)
• A sharp upper bound for the number of connected sets in any grid graph
  di: Ma, Hongxia, et al.
  Pubblicazione: (2025)
• Comparing list-color functions of uniform hypergraphs with their chromatic polynomials (III)
  di: Dong, Fengming, et al.
  Pubblicazione: (2022)
• Comparing list-color functions of uniform hypergraphs with their chromatic polynomials
  di: Dong, Fengming, et al.
  Pubblicazione: (2023)
• On the number of connected edge cover sets in a graph
  di: Zare, Mahsa, et al.
  Pubblicazione: (2024)