Longest cycles in 3-connected graphs with given independence number

DOI10.1007/S00373-009-0846-8zbMath1207.05107OpenAlexW2094842655MaRDI QIDQ1043819

Yannis Manoussakis

Publication date: 9 December 2009

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-009-0846-8

zbMATH Keywords

independence numberlongest cycles3-connected graphs

Mathematics Subject Classification ID

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

Related Items (3)

Circumferences of k-connected graphs involving independence numbers ⋮ Longest cycles in \(k\)-connected graphs with given independence number ⋮ Intersections of cycles in \(k\)-connected graphs

Cites Work

• Unnamed Item
• Cycles in graphs with prescribed stability number and connectivity
• A note on Hamiltonian circuits

This page was built for publication: Longest cycles in 3-connected graphs with given independence number