Decomposition of Finite Graphs into Open Chains

DOI10.4153/CJM-1961-012-1MaRDI QIDQ3275435zbMATH OpenFDO

Authors C. St. J. A. Nash-Williams

Publication date 1961

Published in Canadian Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4153/CJM-1961-012-1

zbMATH Keywords

topology

Cited in

(7)

• scientific article; zbMATH DE number 3717365 (Why is no real title available?)
• Large cycles in 4-connected graphs
• Dirac-type generalizations concerning large cycles in graphs
• Bibliography on domination in graphs and some basic definitions of domination parameters
• Degree conditions for Hamiltonicity: counting the number of missing edges
• Some degree bounds for the circumference of graphs
• On packing Hamilton cycles in \(\varepsilon\)-regular graphs

This page was built for publication: Decomposition of Finite Graphs into Open Chains

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