Long cycles in triangle-free graphs with prescribed independence number and connectivity

DOI10.1016/J.JCTB.2003.05.002zbMath1042.05055OpenAlexW2157627899MaRDI QIDQ1826952

Bing Wei, Akira Saito, Hikoe Enomoto, Atsushi Kaneko

Publication date: 6 August 2004

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

Full work available at URL: https://doi.org/10.1016/j.jctb.2003.05.002

zbMATH Keywords

ConnectivityIndependence numberLongest cycleTriangle-free graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)

Related Items (6)

Chvátal–Erdős Theorem: Old Theorem with New Aspects ⋮ Unnamed Item ⋮ Relative length of longest paths and longest cycles in triangle-free graphs ⋮ An extension of the Win theorem: counting the number of maximum independent sets ⋮ The Chvàtal-Erdős condition for supereulerian graphs and the Hamiltonian index ⋮ An extension of the Chvátal-Erdős theorem: counting the number of maximum independent sets

Cites Work

• Unnamed Item
• Unnamed Item
• Longest cycles in triangle-free graphs
• Cycles in graphs with prescribed stability number and connectivity
• The Chvátal-Erdös condition for cycles in triangle-free graphs
• A note on Hamiltonian circuits

This page was built for publication: Long cycles in triangle-free graphs with prescribed independence number and connectivity