Uncontractable 4-connected graphs
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3979093
- Minimal Cyclic-4-Connected Graphs
- A recursive characterization of the 4-connected graphs
- Contractible edges in a 4-connected graph with vertices of degree greater than four
- Contractible edges in \(n\)-connected graphs with minimum degree greater than or equal to \([5n/4]\)
Cited in
(61)- Trivially noncontractible edges in a contraction critically 5-connected graph
- Contractible edges and triangles in k-connected graphs
- Edges incident with a vertex of degree greater than four and the number of contractible edges in a 4-connected graph
- A constructive characterization of contraction critical 8-connected graphs with minimum degree 9
- Splitting and contractible edges in 4-connected graphs
- Removable edges in a spanning tree of a k-connected graph
- Removable edges in cycles of a k-connected graph
- On the structure of contractible edges in \(k\)-connected partial \(k\)-trees
- A characterization of internally 4-connected \(\{P_{10}- \{v_1,v_2\}\}\)-minor-free graphs
- Contractible edges in minimally \(k\)-connected graphs
- Graphs with no \(\bar{P}_7\)-minor
- A new degree sum condition for the existence of a contractible edge in a -connected graph
- Contractible edges in a 4-connected graph with vertices of degree greater than four
- Contractible cliques in k-connected graphs
- Removable edges in a \(k\)-connected graph and a construction method for \(k\)-connected graphs
- Subgraph induced by the set of degree 5 vertices in a contraction critically 5-connected graph
- Contractions of 6-connected toroidal graphs
- A chain theorem for 4-connected graphs
- Edges not contained in triangles and the number of contractible edges in a 4-connected graph
- Some structural properties of minimally contraction-critically 5-connected graphs
- Long cycles in 4-connected planar graphs
- Minimally contraction-critically 6-connected graphs
- A local structure theorem on 5-connected graphs
- The number of removable edges in a 4-connected graph
- Strengthened chain theorems for different versions of 4-connectivity
- Addible edges in 2-matching-connected graphs and 3-matching-connected graphs
- On the decomposition of a 3-connected graph into cyclically 4-edge-connected components
- A characterization of graphs with no cube minor
- Vertices of degree 6 in a contraction critically 6-connected graph
- Cycles in 4-connected planar graphs
- Contractible edges and liftable vertices in a 4-connected graph
- Quartic graphs with every edge in a triangle
- Removable edges in a 5-connected graph and a construction method of 5-connected graphs
- Cycle spectra of contraction-critically 4-connected planar graphs
- Subgraph induced by the set of degree 5 vertices in a contraction critically 5-connected graph
- scientific article; zbMATH DE number 2230263 (Why is no real title available?)
- Contractible edges in 7-connected graphs
- High connectivity keeping sets in graphs and digraphs
- Contractible edges in \(k\)-connected graphs with some forbidden subgraphs
- Reductions of 3-connected graphs with minimum degree at least four
- The number of vertices of degree 5 in a contraction-critically 5-connected graph
- A recursive characterization of the 4-connected graphs
- Minimal Cyclic-4-Connected Graphs
- The excluded minor theorem for the Petersen graph contracting exactly two edges of a perfect matching and one other edge
- Contractions, cycle double covers, and cyclic colorings in locally connected graphs
- Refining a chain theorem from matroids to internally 4-connected graphs
- How to contract an essentially 6-connected graph to a 5-connected graph
- Some properties of contraction-critical 5-connected graphs
- A new lower bound on the number of trivially noncontractible edges in contraction critical 5-connected graphs
- Nonseparating cycles avoiding specific vertices
- Edges not contained in triangles and the distribution of contractible edges in a 4-connected graph
- Vertices of degree 6 in a 6-contraction critical graph
- Reconfiguration of graph minors
- The average degree of minimally contraction-critically 5-connected graphs
- The new lower bound of the number of vertices of degree 5 in contraction critical 5-connected graphs
- Reduction for 3-connected graphs of minimum degree at least four
- Removable edges of cycles in 5-connected graphs
- Max-min weight balanced connected partition
- scientific article; zbMATH DE number 3979093 (Why is no real title available?)
- A constructive characterization of 4-connected graphs
- A note on 4-connected planar \(K_{1,1,5}\)-minor-free graphs
This page was built for publication: Uncontractable 4-connected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3964606)
