The Chvátal-Erdös condition for cycles in triangle-free graphs

DOI10.1016/0012-365X(96)80461-4zbMath0857.05056MaRDI QIDQ1917498

Dingjun Lou

Publication date: 4 September 1996

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

zbMATH Keywords

Hamiltoniancyclesindependence numberconnectivity

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40)

Related Items (8)

CYCLES IN TRIANGLE-FREE GRAPHS ⋮ A note on pancyclism of highly connected graphs ⋮ Chvátal–Erdős Theorem: Old Theorem with New Aspects ⋮ Hamiltonicity, independence number, and pancyclicity ⋮ Pancyclicity of Hamiltonian and highly connected graphs ⋮ A 2‐factor with two components of a graph satisfying the Chvátal‐Erdös condition ⋮ Long cycles in triangle-free graphs with prescribed independence number and connectivity ⋮ Results and problems on chorded cycles: a survey

Cites Work

• Pancyclism in Chvátal-Erdős' graphs
• Toughness and triangle-free graphs
• Chvátal-Erdős conditions for paths and cycles in graphs and digraphs. A survey
• A note on Hamiltonian circuits
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The Chvátal-Erdös condition for cycles in triangle-free graphs