A Fan-type condition for cycles in $1$-tough and $k$-connected $(P_2\cup kP_1)$-free graphs

Documenti analoghi

• On hamiltonian cycles of 1-tough $(P_{2} \cup kP_{1})$-free graphs
  di: Sanka, Masahiro
  Pubblicazione: (2026)
• Every $2k$-connected $(P_2\cup kP_1)$-free graph with toughness greater than one is hamiltonian-connected
  di: Liu, Feng
  Pubblicazione: (2025)
• A Fan-type condition involving bipartite independence number for hamiltonicity in graphs
  di: Liu, Hongxi, et al.
  Pubblicazione: (2025)
• On the girth and connectivity of cubic graphs with a unique longest cycle
  di: Jooken, Jorik, et al.
  Pubblicazione: (2024)
• Hamiltonian cycles passing through matchings in $k$-ary $n$-cubes
  di: Liao, Baolai, et al.
  Pubblicazione: (2024)