Path partition number in tough graphs

DOI10.1016/S0012-365X(96)00063-5zbMath0878.05056MaRDI QIDQ1356718

Vũ Đình Hòa

Publication date: 5 January 1998

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

Hamiltoniantoughnesspath partition number

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Proof of a conjecture of T. Gallai concerning connectivity properties of colour-critical graphs
• Tough graphs and Hamiltonian circuits.
• Toughness and the existence ofk-factors
• Hamiltonian circuits and path coverings of vertices in graphs
• Toughness, minimum degree, and the existence of 2‐factors

This page was built for publication: Path partition number in tough graphs