The number of vertices of degree 5 in a contraction-critically 5-connected graph
From MaRDI portal
Publication:2275451
DOI10.1016/j.disc.2011.04.032zbMath1223.05148OpenAlexW1964540042MaRDI QIDQ2275451
Publication date: 9 August 2011
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2011.04.032
Related Items (12)
On the structure of \(C_3\)-critical minimal 6-connected graphs ⋮ A constructive characterization of 4-connected graphs ⋮ A new forbidden subgraph for 5-contractible edges ⋮ Properly 3-contractible edges in a minimally 3-connected graph ⋮ The removable edges and the contractible subgraphs of 5-connected graphs ⋮ The Average Degree of Minimally Contraction‐Critically 5‐Connected Graphs ⋮ Some structural properties of minimally contraction-critically 5-connected graphs ⋮ On vertices of degree 6 of minimal and contraction critical 6-connected graph ⋮ Contractible edges in \(k\)-connected graphs with minimum degree greater than or equal to \(\lfloor \frac{ 3 k - 1}{ 2} \rfloor \) ⋮ Contractible edges and contractible triangles in a 3-connected graph ⋮ A constructive characterization of contraction critical 8-connected graphs with minimum degree 9 ⋮ A local condition for \(k\)-contractible edges
Cites Work
- Unnamed Item
- Unnamed Item
- Contractible edges in \(n\)-connected graphs with minimum degree greater than or equal to \([5n/4\)]
- Vertices of degree 5 in a contraction critically 5-connected graph
- A degree sum condition for the existence of a contractible edge in a \(\kappa\)-connected graph
- The new lower bound of the number of vertices of degree 5 in contraction critical 5-connected graphs
- Nonseparating cycles inK-Connected graphs
- Uncontractable 4-connected graphs
This page was built for publication: The number of vertices of degree 5 in a contraction-critically 5-connected graph
