A closure concept based on neighborhood unions of independent triples

DOI10.1016/0012-365X(92)00049-WzbMath0789.05059OpenAlexW2113707442MaRDI QIDQ1313822

Ingo Schiermeyer, Hajo J. Broersma

Publication date: 12 June 1994

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

Full work available at URL: https://doi.org/10.1016/0012-365x(92)00049-w

zbMATH Keywords

Hamiltonian graphHamiltonian circuitsclosureneighborhood unionsindependent triples

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items

\(\alpha\)-degree closures for graphs, \(\beta \)-degree closures for graphs

Cites Work

• Semi-independence number of a graph and the existence of Hamiltonian circuits
• Hamiltonism, degree sum and neighborhood intersections
• A method in graph theory
• Note on Hamilton Circuits
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item