Every 3-connected \(\{K_{1, 3}, \Gamma_3\}\)-free graph is Hamilton-connected

DOI10.1016/j.disc.2024.114305MaRDI QIDQ6646424

Petr Vrána, Adam Kabela, Mária Skyvová, Zdeněk Ryjáček

Publication date: 2 December 2024

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

closureHamilton-connectedforbidden subgraphclaw-free\(\Gamma_3\)-free

Mathematics Subject Classification ID

Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Unnamed Item
• 3-connected \(\{K_{1,3},P_9\}\)-free graphs are Hamiltonian-connected
• On a closure concept in claw-free graphs
• Characterizing forbidden pairs for hamiltonian properties
• Eulerian subgraphs and Hamilton-connected line graphs
• Every 3-connected \(\{ K_{1 , 3} , Z_7 \}\)-free graph of order at least 21 is Hamilton-connected
• Graphe représentatif des arêtes d'un multigraphe
• Strongly spanning trailable graphs with small circumference and Hamilton-connected claw-free graphs
• On stability of Hamilton-connectedness under the 2-closure in claw-free graphs
• Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs
• Closure and stable Hamiltonian properties in claw-free graphs
• An analogue of the Whithey theorem for edge graphs of multigraphs, and edge multigraphs
• Forbidden subgraphs that imply hamiltonian‐connectedness*
• A Closure for 1‐Hamilton‐Connectedness in Claw‐Free Graphs
• On Eulerian and Hamiltonian Graphs and Line Graphs
• Hamilton‐connected {claw,net}‐free graphs, II
• Hamilton‐connected {claw, bull}‐free graphs
• Hamilton‐connected {claw, net}‐free graphs, I
• A closure for Hamilton-connectedness in \(\{K_{1,3}, \Gamma_3\}\)-free graphs

This page was built for publication: Every 3-connected \(\{K_{1, 3}, \Gamma_3\}\)-free graph is Hamilton-connected