A sufficient condition for a graph to be Hamiltonian

DOI10.1007/BF01303743zbMath0461.05043OpenAlexW2007310910MaRDI QIDQ1152383

Norbert Köhler

Publication date: 1981

Published in: Monatshefte für Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/178037

zbMATH Keywords

Hamiltonian graphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

Hamiltonian graphs involving distances

Cites Work

• On path-coverings and Hamilton-connectivity of finite graphs
• Maximale Kreise in Graphen
• Note on Hamilton Circuits
• On Maximal Circuits in Finite Graphs

This page was built for publication: A sufficient condition for a graph to be Hamiltonian