Subgraphs, closures and hamiltonicity

DOI10.1016/0166-218X(94)90092-2zbMath0811.05041MaRDI QIDQ1329802

Ingo Schiermeyer, Hajo J. Broersma

Publication date: 3 May 1995

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

zbMATH Keywords

distancehamiltonicityclosure theorems

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computation of the 0-dual closure for hamiltonian graphs
• A generalization of the Bondy-Chvátal theorem on the k-closure
• New sufficient conditions for cycles in graphs
• 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
• Stable properties of graphs
• Cycles containing many vertices of large degree
• A method in graph theory
• A note on \(K_ 4\)-closures in hamiltonian graph theory
• Note on Hamilton Circuits
• 2‐neighborhoods and hamiltonian conditions

This page was built for publication: Subgraphs, closures and hamiltonicity