Note on non-separating and removable cycles in highly connected graphs
From MaRDI portal
Publication:1003687
DOI10.1016/J.DAM.2008.06.012zbMath1168.05319OpenAlexW2067814112MaRDI QIDQ1003687
Shinya Fujita, Ken-ichi Kawarabayashi
Publication date: 4 March 2009
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2008.06.012
Related Items (1)
Cites Work
- A weaker version of Lovász' path removal conjecture
- Cycles in k-connected graphs whose deletion results in a (k-2)-connected graph
- Contractible edges in non-separating cycles
- Removable circuits in multigraphs
- Contractible cycles in graphs with girth at least 5
- Contractible bonds in graphs
- Contractible edges and triangles in \(k\)-connected graphs
- Kreuzungsfreie a,b-Wege in endlichen Graphen
- Removable Cycles in 2-Connected Graphs of Minimum Degree at Least Four
- Nonseparating cycles inK-Connected graphs
- Triangle Density and Contractibility
This page was built for publication: Note on non-separating and removable cycles in highly connected graphs