A recursive characterization of the 4-connected graphs
From MaRDI portal
Publication:2277470
DOI10.1016/0012-365X(90)90277-OzbMath0726.05046OpenAlexW1997938644WikidataQ127526186 ScholiaQ127526186MaRDI QIDQ2277470
Publication date: 1990
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(90)90277-o
Related Items (17)
On the structure of \(C_3\)-critical minimal 6-connected graphs ⋮ Reduction for 3-connected graphs of minimum degree at least four ⋮ On the structure of contractible edges in \(k\)-connected partial \(k\)-trees ⋮ Reductions of 3-connected graphs with minimum degree at least four ⋮ The structure of quasi 4-connected graphs ⋮ Contractions, cycle double covers, and cyclic colorings in locally connected graphs ⋮ 5-Shredders of Contraction-Critical 5-Connected Graphs ⋮ On local structure of 9- and 10-connected graphs ⋮ Splitting and contractible edges in 4-connected graphs ⋮ Local structure of 5- and 6-connected graphs ⋮ Local structure of 7- and 8-connected graphs ⋮ On vertices of degree 6 of minimal and contraction critical 6-connected graph ⋮ Bisecting a 4-connected graph with three resource sets ⋮ Edges incident with a vertex of degree greater than four and a lower bound on the number of contractible edges in a 4-connected graph ⋮ On the number of 4-contractible edges in 4-connected graphs ⋮ Spanning trees with many leaves: new lower bounds in terms of the number of vertices of degree 3 and at least 4 ⋮ High connectivity keeping sets in graphs and digraphs
Cites Work
This page was built for publication: A recursive characterization of the 4-connected graphs
