Recommendations
Cites work
- scientific article; zbMATH DE number 4142080 (Why is no real title available?)
- scientific article; zbMATH DE number 4075117 (Why is no real title available?)
- scientific article; zbMATH DE number 44783 (Why is no real title available?)
- 2‐neighborhoods and hamiltonian conditions
- A generalization of the Bondy-Chvátal theorem on the k-closure
- A method in graph theory
- A note on \(K_ 4\)-closures in hamiltonian graph theory
- Computation of the 0-dual closure for hamiltonian graphs
- Cycles containing many vertices of large degree
- Graph theory
- More powerful closure operations on graphs
- New sufficient conditions for cycles in graphs
- Note on Hamilton Circuits
- Semi-independence number of a graph and the existence of Hamiltonian circuits
- Some localization theorems on Hamiltonian circuits
- Stable properties of graphs
- Strong sufficient conditions for the existence of Hamiltonian circuits in undirected graphs
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
- scientific article; zbMATH DE number 3954964 (Why is no real title available?)
- \(\alpha\)-degree closures for graphs
- Extensions of Bondy's theorem on cycles in 2-connected 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)
