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.032zbMATH Open1223.05148OpenAlexW1964540042MaRDI QIDQ2275451FDOQ2275451
Authors: Kiyoshi Ando, Takashi Iwase 
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
Recommendations
- Vertices of degree 5 in a contraction critically 5-connected graph
- The new lower bound of the number of vertices of degree 5 in contraction critical 5-connected graphs
- Some properties of contraction-critical 5-connected graphs
- Subgraph induced by the set of degree 5 vertices in a contraction critically 5-connected graph
- Subgraph induced by the set of degree 5 vertices in a contraction critically 5-connected graph
- The average degree of minimally contraction-critically 5-connected graphs
- Some structural properties of minimally contraction-critically 5-connected graphs
- scientific article; zbMATH DE number 4053657
- On contractible 5-vertex subgraphs of a 3-connected graph
- A new lower bound on the number of trivially noncontractible edges in contraction critical 5-connected graphs
Cites Work
- Uncontractable 4-connected graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Nonseparating cycles inK-Connected graphs
- 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
Cited In (25)
- Vertices of degree 5 in a contraction critically 5-connected graph
- Edges incident with a vertex of degree greater than four and the number of contractible edges in a 4-connected graph
- Contractible edges in \(k\)-connected graphs with minimum degree greater than or equal to \(\lfloor \frac{ 3 k - 1}{ 2} \rfloor \)
- A constructive characterization of contraction critical 8-connected graphs with minimum degree 9
- A local condition for \(k\)-contractible edges
- Title not available (Why is that?)
- Subgraph induced by the set of degree 5 vertices in a contraction critically 5-connected graph
- On the structure of \(C_3\)-critical minimal 6-connected graphs
- Some structural properties of minimally contraction-critically 5-connected graphs
- Local structure of 5- and 6-connected graphs
- Vertices of degree 6 in a contraction critically 6-connected graph
- Subgraph induced by the set of degree 5 vertices in a contraction critically 5-connected graph
- On vertices of degree 6 of minimal and contraction critical 6-connected graph
- The removable edges and the contractible subgraphs of 5-connected graphs
- Small components of the 5-subgraph of a contraction-critically 5-connected graph
- The vertices of lower degree in contraction-critical \(\kappa \)-connected graphs.
- Some properties of contraction-critical 5-connected graphs
- The average degree of minimally contraction-critically 5-connected graphs
- Vertices of degree 6 in a 6-contraction critical graph
- A new lower bound on the number of trivially noncontractible edges in contraction critical 5-connected graphs
- The new lower bound of the number of vertices of degree 5 in contraction critical 5-connected graphs
- Properly 3-contractible edges in a minimally 3-connected graph
- A constructive characterization of 4-connected graphs
- A new forbidden subgraph for 5-contractible edges
- Contractible edges and contractible triangles in a 3-connected graph
This page was built for publication: The number of vertices of degree 5 in a contraction-critically 5-connected graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2275451)
