The number of vertices of degree 7 in a contraction-critical 7-connected graph
From MaRDI portal
Publication:998364
DOI10.1016/j.disc.2007.11.052zbMath1182.05073OpenAlexW2051718638MaRDI QIDQ998364
Jianji Su, Min Li, Xu Dong Yuan
Publication date: 28 January 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.11.052
Related Items (7)
On the structure of \(C_3\)-critical minimal 6-connected graphs ⋮ On local structure of 9- and 10-connected graphs ⋮ On vertices of degree \(k\) of minimal and contraction critical \(k\)-connected graphs: upper bounds ⋮ Local structure of 7- and 8-connected graphs ⋮ On vertices of degree 6 of minimal and contraction critical 6-connected graph ⋮ The number of vertices of degree 7 in a contraction-critical 7-connected graph ⋮ A constructive characterization of contraction critical 8-connected graphs with minimum degree 9
Cites Work
- Unnamed Item
- Unnamed Item
- The number of vertices of degree 7 in a contraction-critical 7-connected graph
- Generalizaions of critical connectivity of graphs
- Contractible edges in \(n\)-connected graphs with minimum degree greater than or equal to \([5n/4\)]
- A degree sum condition for the existence of a contractible edge in a \(\kappa\)-connected graph
- Contractible edges in 7-connected graphs
- Vertices of degree 6 in a 6-contraction critical graph
- Nonseparating cycles inK-Connected graphs
This page was built for publication: The number of vertices of degree 7 in a contraction-critical 7-connected graph
