On the structure of C₃-critical minimal 6-connected graphs
From MaRDI portal
Publication:291173
DOI10.1007/S10958-016-2700-XzbMATH Open1337.05068OpenAlexW2299332969MaRDI QIDQ291173FDOQ291173
Authors: A. V. Pastor 
Publication date: 7 June 2016
Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10958-016-2700-x
Recommendations
- On vertices of degree 6 of minimal and contraction critical 6-connected graph
- Minimally contraction-critically 6-connected graphs
- On (minimal) regular graphs of girth \(6\)
- On the number of edges in a minimum \(C_6\)-saturated graph
- On minimal triangle-free 6-chromatic graphs
- \(K_{6}\) minors in large 6-connected graphs
- \(K_{6}\) minors in 6-connected graphs of bounded tree-width
- scientific article; zbMATH DE number 3987311
- scientific article; zbMATH DE number 861424
- Critical \((P_6, \mathrm{banner})\)-free graphs
Cites Work
- Generalizaions of critical connectivity of graphs
- Zur Struktur minimal n-fach zusammenhängender Graphen
- Vertices of degree 6 in a contraction critically 6-connected graph
- The number of vertices of degree 5 in a contraction-critically 5-connected graph
- A recursive characterization of the 4-connected graphs
- Ecken vom Grad \(n\) in minimalen \(n\)-fach zusammenhängenden Graphen
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Some structural properties of minimally contraction-critically 5-connected graphs
- A theorem on n-connected graphs
- Critically n-Connected Graphs
- Minimally contraction-critically 6-connected graphs
- The number of vertices of degree 7 in a contraction-critical 7-connected graph
Cited In (4)
This page was built for publication: On the structure of \(C_3\)-critical minimal 6-connected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q291173)
