Minimally contraction-critically 6-connected graphs
From MaRDI portal
Publication:658121
DOI10.1016/J.DISC.2011.06.012zbMATH Open1232.05103OpenAlexW2006859900MaRDI QIDQ658121FDOQ658121
Authors: Kiyoshi Ando, Shinya Fujita, Ken-ichi Kawarabayashi
Publication date: 11 January 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2011.06.012
Recommendations
- Vertices of degree 6 in a contraction critically 6-connected graph
- The new lower bound of the number of vertices of degree 5 in contraction critical 5-connected graphs
- On vertices of degree 6 of minimal and contraction critical 6-connected graph
- Some structural properties of minimally contraction-critically 5-connected graphs
- Vertices of degree 6 in a 6-contraction critical graph
Cites Work
Cited In (6)
- On the structure of \(C_3\)-critical minimal 6-connected graphs
- Vertices of degree 6 in a contraction critically 6-connected graph
- On vertices of degree 6 of minimal and contraction critical 6-connected graph
- \(K_{6}\) minors in 6-connected graphs of bounded tree-width
- How to contract an essentially 6-connected graph to a 5-connected graph
- Vertices of degree 6 in a 6-contraction critical graph
This page was built for publication: Minimally contraction-critically 6-connected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q658121)