On path-coverings and Hamilton-connectivity of finite graphs

DOI10.1007/BF01223726zbMath0452.05049OpenAlexW2086499469MaRDI QIDQ1148335

Norbert Köhler

Publication date: 1981

Published in: Archiv der Mathematik (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01223726

zbMATH Keywords

hamiltonian connectivitypath-coverings

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

A sufficient condition for a graph to be Hamiltonian

Cites Work

• Arc coverings of graphs
• Note on Hamilton Circuits
• On maximal paths and circuits of graphs
• On Maximal Circuits in Finite Graphs
• A note on K-path hamiltonian graphs

This page was built for publication: On path-coverings and Hamilton-connectivity of finite graphs