9-connected claw-free graphs are Hamilton-connected

zbMath0932.05051MaRDI QIDQ1305527

Stephan Brandt

Publication date: 27 February 2000

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

zbMATH Keywords

Hamilton-connectedclaw-free

Mathematics Subject Classification ID

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

Related Items (8)

Proof that pyramid networks are 1-Hamiltonian-connected with high probability ⋮ A Closure for 1‐Hamilton‐Connectedness in Claw‐Free Graphs ⋮ The \(*\)-closure for graphs and claw-free graphs ⋮ Degree conditions on induced claws ⋮ 3-connected \(\{K_{1,3},P_9\}\)-free graphs are Hamiltonian-connected ⋮ On stability of Hamilton-connectedness under the 2-closure in claw-free graphs ⋮ Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs ⋮ Line graphs and forbidden induced subgraphs

Cites Work

• Unnamed Item
• Unnamed Item
• On hamiltonian line graphs and connectivity
• A method in graph theory
• A note on \(K_ 4\)-closures in hamiltonian graph theory
• On a closure concept in claw-free graphs
• Closure concepts for claw-free graphs
• Not every 2-tough graph is Hamiltonian
• Hamiltonian results inK1,3-free graphs

This page was built for publication: 9-connected claw-free graphs are Hamilton-connected