Every $2k$-connected $(P_2\cup kP_1)$-free graph with toughness greater than one is hamiltonian-connected

Similar Items

• On hamiltonian cycles of 1-tough $(P_{2} \cup kP_{1})$-free graphs
  by: Sanka, Masahiro
  Published: (2026)
• A Fan-type condition for cycles in $1$-tough and $k$-connected $(P_2\cup kP_1)$-free graphs
  by: Hu, Zhiquan, et al.
  Published: (2024)
• Every $2$-connected $[4, 2]$-graph of order at least seven contains a pancyclic edge
  by: Li, Chengli, et al.
  Published: (2025)
• Spectral radius, toughness and $k$-factor of graphs
  by: Chen, Yuanyuan, et al.
  Published: (2026)
• A sufficient condition for cubic 3-connected plane bipartite graphs to be hamiltonian
  by: Florek, Jan
  Published: (2023)