Computation of the 0-dual closure for hamiltonian graphs

DOI10.1016/0012-365X(93)90183-TMaRDI QIDQ686512zbMATH OpenFDO

Authors 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)

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

Cites work

• scientific article; zbMATH DE number 3924825 (Why is no real title available?)
• scientific article; zbMATH DE number 4043880 (Why is no real title available?)
• scientific article; zbMATH DE number 44783 (Why is no real title available?)
• A generalization of a result of Häggkvist and Nicoghossian
• A method in graph theory
• Graph theory with applications
• More powerful closure operations on graphs
• Neighbourhood unions and Hamiltonian properties in graphs
• Note on Hamilton Circuits
• Note on Hamilton circuits and Hamilton paths
• On Hamilton's ideals
• Semi-independence number of a graph and the existence of Hamiltonian circuits

Cited in

(7)

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

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)