Subgraphs, closures and hamiltonicity

DOI10.1016/0166-218X(94)90092-2zbMATH Open0811.05041MaRDI QIDQ1329802FDOQ1329802

Ingo Schiermeyer, Hajo 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

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• 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
• 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

Cited In (4)

• A closure concept based on neighborhood unions of independent triples
• Computation of the 0-dual closure for hamiltonian graphs
• A note on \(K_ 4\)-closures in hamiltonian graph theory
• The last subconstituent of the Hemmeter graph

Recommendations

• Two theorems on Hamiltonian graphs 👍 👎
• A closure concept based on neighborhood unions of independent triples 👍 👎
• \(\alpha\)-degree closures for graphs 👍 👎
• A note on \(K_ 4\)-closures in hamiltonian graph theory 👍 👎
• Extension of several sufficient conditions for Hamiltonian 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)