A recursive characterization of the 4-connected graphs
A graph is said to be contraction critical if the contraction of any edge decreases its connectivity. It being known that, for \(n=2\) and 3, the only contraction critical graph of connectivity n is \(K_{n+1}\), the author characterizes the 4-connected contraction critical graphs as the 4-valent graphs every edge of which lines on a 3-circuit. These graphs are presented in an earlier paper by the author [J. Graph Theory 6, 343- 344 (1982; Zbl 0499.05041)] and a still earlier paper of \textit{M. Fontet} [C. R. Acad. Sci. Paris, Sér. A 287, 289-290 (1978; Zbl 0386.05039)].
- A constructive characterization of 4-connected graphs
- A characterization of weakly four‐connected graphs
- A charcterization of 4‐edge‐connected eulerian graphs
- A characterization of graphs with rank 4
- The A₄-structure of a graph
- Characterizing and recognizing 4-map graphs
- A chain theorem for 4-connected graphs
- The structure of quasi 4-connected graphs
- scientific article; zbMATH DE number 4114678
- A characterization of \((4,2)\)-choosable graphs
- The structure of quasi 4-connected graphs
- Splitting and contractible edges in 4-connected graphs
- A chain theorem for 4-connected graphs
- 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 local structure of 9- and 10-connected graphs
- On vertices of degree 6 of minimal and contraction critical 6-connected graph
- Local structure of 5- and 6-connected graphs
- Local structure of 7- and 8-connected graphs
- Reduction for 3-connected graphs of minimum degree at least four
- On the number of 4-contractible edges in 4-connected graphs
- High connectivity keeping sets in graphs and digraphs
- On the structure of \(C_3\)-critical minimal 6-connected graphs
- Reductions of 3-connected graphs with minimum degree at least four
- scientific article; zbMATH DE number 3979093 (Why is no real title available?)
- Uncontractable 4-connected graphs
- scientific article; zbMATH DE number 512928 (Why is no real title available?)
- 5-shredders of contraction-critical 5-connected graphs
- THE EXISTENCE CONDITION OF A 4-CONNECTED GRAPH WITH SPECIFIED CONFIGURATIONS
- A characterization of graphs with rank 4
- The minimum size and maximum diameter of an edge-pancyclic graph of a given order
- Spanning trees with many leaves: new lower bounds in terms of the number of vertices of degree 3 and at least 4
- On the structure of contractible edges in \(k\)-connected partial \(k\)-trees
- Contractions, cycle double covers, and cyclic colorings in locally connected graphs
- Bisecting a 4-connected graph with three resource sets
This page was built for publication: A recursive characterization of the 4-connected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2277470)
