Circumferences of k-connected graphs involving independence numbers

DOI10.1002/jgt.20540zbMath1230.05194OpenAlexW2042657911MaRDI QIDQ3174236

Yaping Wu, Zhi-quan Hu, Guantao Chen

Publication date: 12 October 2011

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20540

zbMATH Keywords

independence numberconnectivitycircumference

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Eulerian and Hamiltonian graphs (05C45)

Related Items (4)

Rainbow connection number and independence number of a graph ⋮ An extension of the Win theorem: counting the number of maximum independent sets ⋮ 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

• Unnamed Item
• Longest cycles in 3-connected graphs with given independence number
• A remark on two sufficient conditions for Hamilton cycles
• Cycles in graphs with prescribed stability number and connectivity
• Intersections of longest cycles in \(k\)-connected graphs
• Advances on the Hamiltonian problem -- a survey
• Long cycles through a linear forest
• A note on Hamiltonian circuits
• Note on Hamilton Circuits
• In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
• Some Theorems on Abstract Graphs

This page was built for publication: Circumferences of k-connected graphs involving independence numbers