Subgraphs, closures and hamiltonicity
From MaRDI portal
Publication:1329802
DOI10.1016/0166-218X(94)90092-2zbMATH Open0811.05041MaRDI QIDQ1329802FDOQ1329802
Authors: Ingo Schiermeyer, Hajo Broersma 
Publication date: 3 May 1995
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Recommendations
Cites Work
- Graph theory
- Note on Hamilton Circuits
- 2‐neighborhoods and hamiltonian conditions
- New sufficient conditions for cycles in graphs
- Some localization theorems on Hamiltonian circuits
- A method in graph theory
- A generalization of the Bondy-Chvátal theorem on the k-closure
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Computation of the 0-dual closure for hamiltonian graphs
- Stable properties of graphs
- A note on \(K_ 4\)-closures in hamiltonian graph theory
- Cycles containing many vertices of large degree
- Title not available (Why is that?)
Cited In (13)
- A closure concept based on neighborhood unions of independent triples
- Computation of the 0-dual closure for hamiltonian graphs
- Closures, cycles, and paths
- A generalization of a result of Häggkvist and Nicoghossian
- Two theorems on Hamiltonian graphs
- A note on \(K_ 4\)-closures in hamiltonian graph theory
- Edge closures of Hamiltonian type
- Extension of several sufficient conditions for Hamiltonian graphs
- A closure lemma for tough graphs and Hamiltonian degree conditions
- The last subconstituent of the Hemmeter graph
- Title not available (Why is that?)
- Extensions of Bondy's theorem on cycles in 2-connected graphs
- \(\alpha\)-degree closures for graphs
This page was built for publication: Subgraphs, closures and hamiltonicity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1329802)
