Contractible subgraphs in 3-connected graphs
From MaRDI portal
(Redirected from Publication:1850482)
Recommendations
- Large contractible subgraphs of a 3-connected graph
- Contractible subgraphs ink-connected graphs
- Contractible edges in 3-connected graphs
- Contractible triples in 3-connected graphs
- scientific article; zbMATH DE number 4043878
- scientific article; zbMATH DE number 2108141
- Contractible circuits in \(3\)-connected graphs
- Contractible non-edges in \(3\)-connected graphs
- Contractible small subgraphs in \(k\)-connected graphs
- Contractible Edges in 3-Connected Cubic Graphs
Cites work
- scientific article; zbMATH DE number 3166039 (Why is no real title available?)
- scientific article; zbMATH DE number 3987316 (Why is no real title available?)
- scientific article; zbMATH DE number 1025912 (Why is no real title available?)
- Contractible edges in 3-connected graphs
- Contractible triples in 3-connected graphs
- Covering contractible edges in 3‐connected graphs. I: Covers of size three are cutsets
- Edge-Disjoint Spanning Trees of Finite Graphs
- Generalizaions of critical connectivity of graphs
- Graph decomposition with applications to subdivisions and path systems modulo k
- Induced paths in 5-connected graphs
- Kuratowski's theorem
- On induced subgraphs of a block
- On the Problem of Decomposing a Graph into n Connected Factors
- Zur Theorie der n-fach zusammenhängenden Graphen
Cited in
(19)- Contractible and removable edges in 3-connected infinite graphs
- Large contractible subgraphs of a 3-connected graph
- Reduction for 3-connected graphs of minimum degree at least four
- Almost all 3-connected graphs contain a contractible set of \(k\) vertices
- Contractible small subgraphs in \(k\)-connected graphs
- An extremal problem on contractible edges in 3-connected graphs
- On the number of contractible triples in 3-connected graphs
- On small contractible subgraphs in 3-connected graphs of small average degree
- Contractible triples in highly connected graphs
- An included-minor result for 3-connected graphs with contractible edges
- Induced paths in 5-connected graphs
- Plane graphs with acyclic clique complex are contractible
- Contractions, cycle double covers, and cyclic colorings in locally connected graphs
- On contractible 5-vertex subgraphs of a 3-connected graph
- On \(k\)-con-critically \(n\)-connected graphs
- On the number of noncritical vertices in strongly connected digraphs
- A connected subgraph maintaining high connectivity
- High connectivity keeping sets in graphs and digraphs
- On contractible and vertically contractible elements in 3-connected matroids and graphs
This page was built for publication: Contractible subgraphs in 3-connected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1850482)
