Closure concepts for claw-free graphs

DOI10.1016/S0012-365X(97)00210-0zbMath0955.05087MaRDI QIDQ1584245

H. Trommel, Hajo J. Broersma

Publication date: 2 November 2000

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

zbMATH Keywords

line graphclosureclaw-free graphs

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Eulerian and Hamiltonian graphs (05C45)

Related Items (6)

Cycles through given vertices and closures ⋮ Computing Sharp 2-Factors in Claw-Free Graphs ⋮ Computing sharp 2-factors in claw-free graphs ⋮ The \(*\)-closure for graphs and claw-free graphs ⋮ Degree conditions on induced claws ⋮ 9-connected claw-free graphs are Hamilton-connected

Cites Work

• Unnamed Item
• On hamiltonian line graphs and connectivity
• A note on \(K_ 4\)-closures in hamiltonian graph theory
• Hamiltonian results inK1,3-free graphs
• Every connected, locally connected nontrivial graph with no induced claw is hamiltonian
• Reflections on graph theory

This page was built for publication: Closure concepts for claw-free graphs