Longest cycles in \(k\)-connected graphs with given independence number

DOI10.1016/j.jctb.2011.02.005zbMath1234.05139OpenAlexW2103673399MaRDI QIDQ651036

Douglas B. West, Hehui Wu, Suil O

Publication date: 8 December 2011

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.2011.02.005

zbMATH Keywords

independence numberconnectivitycircumferenceChvatal-Erdos theoremFouquet-Jolivet conjecture

Mathematics Subject Classification ID

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

Related Items (8)

Large degree vertices in longest cycles of graphs. I ⋮ Cyclability, connectivity and circumference ⋮ The longest cycle problem is polynomial on interval graphs ⋮ The optimal proper connection number of a graph with given independence number ⋮ Highly connected subgraphs of graphs with given independence number ⋮ Highly connected subgraphs of graphs with given independence number (extended abstract) ⋮ An extension of the Chvátal-Erdős theorem: counting the number of maximum independent sets ⋮ Intersections of cycles in \(k\)-connected graphs

Cites Work

• Longest cycles in 3-connected graphs with given independence number
• Cycles in graphs with prescribed stability number and connectivity
• A note on Hamiltonian circuits
• Unnamed Item

This page was built for publication: Longest cycles in \(k\)-connected graphs with given independence number