A sufficient condition for a graph to be Hamiltonian

DOI10.1007/BF01303743zbMATH Open0461.05043OpenAlexW2007310910MaRDI QIDQ1152383FDOQ1152383

Authors: 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

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

Cites Work

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

Cited In (1)

• Hamiltonian graphs involving distances

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1152383)