Longest cycles in k-connected graphs with given independence number

DOI10.1016/J.JCTB.2011.02.005zbMATH Open1234.05139OpenAlexW2103673399MaRDI QIDQ651036FDOQ651036

Authors: Suil O, Douglas B. West, Hehui Wu 

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

Recommendations

• Longest cycles in 3-connected graphs with given independence number
• Circumferences of \(k\)-connected graphs involving independence numbers
• scientific article; zbMATH DE number 3908470
• Long cycles in triangle-free graphs with prescribed independence number and connectivity
• A note on circumferences in \(k\)-connected graphs with given independence number

zbMATH Keywords

circumferenceconnectivityindependence numberChvatal-Erdos theoremFouquet-Jolivet conjecture

Mathematics Subject Classification ID

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

Cites Work

• Cycles in graphs with prescribed stability number and connectivity
• A note on Hamiltonian circuits
• Longest cycles in 3-connected graphs with given independence number
• Title not available (Why is that?)

Cited In (16)

• Intersections of cycles in \(k\)-connected graphs
• On a conjecture of Bondy
• An extension of the Chvátal-Erdős theorem: counting the number of maximum independent sets
• A note on circumferences in \(k\)-connected graphs with given independence number
• The longest cycle problem is polynomial on interval graphs
• Large degree vertices in longest cycles of graphs. I
• On the Thomassen's conjecture
• Highly connected subgraphs of graphs with given independence number
• Long cycles in triangle-free graphs with prescribed independence number and connectivity
• Cyclability, connectivity and circumference
• Title not available (Why is that?)
• The optimal proper connection number of a graph with given independence number
• Highly connected subgraphs of graphs with given independence number (extended abstract)
• Longest cycles in 3-connected graphs with given independence number
• Title not available (Why is that?)
• Circumferences of \(k\)-connected graphs involving independence numbers

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q651036)