Computation of the 0-dual closure for hamiltonian graphs

DOI10.1016/0012-365X(93)90183-TzbMATH Open0789.05060MaRDI QIDQ686512FDOQ686512

Ingo Schiermeyer

Publication date: 24 March 1994

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

Recommendations

• Extension of several sufficient conditions for Hamiltonian graphs
• 0-dual closures for several classes of graphs
• Subgraphs, closures and hamiltonicity
• \(\alpha\)-degree closures for graphs
• Variations on a sufficient condition for Hamiltonian graphs

zbMATH Keywords

closurehamiltonian graphs

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Cites Work

• On Hamilton's ideals
• Title not available (Why is that?)
• Note on Hamilton Circuits
• Title not available (Why is that?)
• A method in graph theory
• Neighbourhood unions and Hamiltonian properties in graphs
• A generalization of a result of Häggkvist and Nicoghossian
• Semi-independence number of a graph and the existence of Hamiltonian circuits
• More powerful closure operations on graphs
• Note on Hamilton circuits and Hamilton paths
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (5)

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

This page was built for publication: Computation of the 0-dual closure for hamiltonian graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q686512)