Intersections of cycles in \(k\)-connected graphs
From MaRDI portal
Publication:2354605
DOI10.1007/S00373-014-1427-ZzbMath1332.05077OpenAlexW2074339193MaRDI QIDQ2354605
Le Chen, Derrick Liu, Jessica Chen
Publication date: 20 July 2015
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-014-1427-z
Cites Work
- Unnamed Item
- Unnamed Item
- Longest cycles in \(k\)-connected graphs with given independence number
- Longest cycles in 3-connected graphs with given independence number
- Intersections of longest cycles in \(k\)-connected graphs
- Circumferences of k-connected graphs involving independence numbers
- A polynomial algorithm for the max-cut problem on graphs without long odd cycles
- Some Theorems on Abstract Graphs
This page was built for publication: Intersections of cycles in \(k\)-connected graphs