Computation of the 0-dual closure for hamiltonian graphs

DOI10.1016/0012-365X(93)90183-TzbMath0789.05060MaRDI QIDQ686512

Ingo Schiermeyer

Publication date: 24 March 1994

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

zbMATH Keywords

closurehamiltonian graphs

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items

Subgraphs, closures and hamiltonicity ⋮ A common generalization of Chvátal-Erdös' and Fraisse's sufficient conditions for hamiltonian graphs ⋮ \(\beta\)-neighborhood closures for graphs ⋮ A note on \(K_ 4\)-closures in hamiltonian graph theory

Cites Work

• Semi-independence number of a graph and the existence of Hamiltonian circuits
• A generalization of a result of Häggkvist and Nicoghossian
• Neighbourhood unions and Hamiltonian properties in graphs
• More powerful closure operations on graphs
• A method in graph theory
• On Hamilton's ideals
• Note on Hamilton circuits and Hamilton paths
• Note on Hamilton Circuits
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item