A note on \(K_ 4\)-closures in hamiltonian graph theory

DOI10.1016/0012-365X(93)90533-YzbMath0789.05057MaRDI QIDQ1309444

Hajo J. Broersma

Publication date: 20 December 1993

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

zbMATH Keywords

hamiltonian graphclaw-free graph

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items

Subgraphs, closures and hamiltonicity ⋮ Claw-free graphs---a survey ⋮ The \(*\)-closure for graphs and claw-free graphs ⋮ Degree conditions on induced claws ⋮ Closure concepts for claw-free graphs ⋮ 9-connected claw-free graphs are Hamilton-connected

Cites Work

• Computation of the 0-dual closure for hamiltonian graphs
• A generalization of the Bondy-Chvátal theorem on the k-closure
• Some localization theorems on Hamiltonian circuits
• Semi-independence number of a graph and the existence of Hamiltonian circuits
• Strong sufficient conditions for the existence of Hamiltonian circuits in undirected graphs
• More powerful closure operations on graphs
• A method in graph theory
• Unnamed Item
• Unnamed Item
• Unnamed Item