On a generalization of a theorem of Nash-Williams

DOI10.1016/0095-8956(91)90088-2zbMath0754.05050OpenAlexW2030154415MaRDI QIDQ1179465

Bert Fassbender

Publication date: 26 June 1992

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(91)90088-2

zbMATH Keywords

Hamiltonianindependence numberminimum degreetheorem of Nash-Williams

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• On maximal paths and circuits of graphs
• Long paths and large cycles in finite graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On a generalization of a theorem of Nash-Williams