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.052zbMATH Open1182.05073OpenAlexW2051718638MaRDI QIDQ998364FDOQ998364
Jianji Su, Min Li, Xudong 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
Recommendations
Cites Work
- Title not available (Why is that?)
- Generalizaions of critical connectivity of graphs
- Title not available (Why is that?)
- The number of vertices of degree 7 in a contraction-critical 7-connected graph
- Nonseparating cycles inK-Connected 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
Cited In (10)
- Title not available (Why is that?)
- A constructive characterization of contraction critical 8-connected graphs with minimum degree 9
- On the structure of \(C_3\)-critical minimal 6-connected graphs
- The number of vertices of degree 7 in a contraction-critical 7-connected graph
- On the density of \(C_7\)-critical 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
- On vertices of degree 6 of minimal and contraction critical 6-connected graph
- Title not available (Why is that?)
- Local structure of 7- and 8-connected graphs
This page was built for publication: The number of vertices of degree 7 in a contraction-critical 7-connected graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q998364)
