Contractible subgraphs in 3-connected graphs
From MaRDI portal
Publication:1850482
DOI10.1006/jctb.2000.1960zbMath1024.05051OpenAlexW2042939975MaRDI QIDQ1850482
Publication date: 10 December 2002
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/95348105dda6ca221bfb68bad08cd1359a79c268
Related Items
Reduction for 3-connected graphs of minimum degree at least four ⋮ Contractions, cycle double covers, and cyclic colorings in locally connected graphs ⋮ Contractible small subgraphs in \(k\)-connected graphs ⋮ Induced paths in 5-connected graphs ⋮ On \(k\)-con-critically \(n\)-connected graphs ⋮ On contractible 5-vertex subgraphs of a 3-connected graph ⋮ Large contractible subgraphs of a 3-connected graph ⋮ Contractible triples in highly connected graphs ⋮ On small contractible subgraphs in 3-connected graphs of small average degree ⋮ On the number of contractible triples in 3-connected graphs ⋮ On the number of noncritical vertices in strongly connected digraphs ⋮ An extremal problem on contractible edges in 3-connected graphs ⋮ A connected subgraph maintaining high connectivity ⋮ High connectivity keeping sets in graphs and digraphs ⋮ Almost all 3-connected graphs contain a contractible set of \(k\) vertices ⋮ Contractible and removable edges in 3-connected infinite graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Contractible edges in 3-connected graphs
- Generalizaions of critical connectivity of graphs
- Contractible triples in 3-connected graphs
- Zur Theorie der n-fach zusammenhängenden Graphen
- Induced paths in 5-connected graphs
- On the Problem of Decomposing a Graph into n Connected Factors
- Edge-Disjoint Spanning Trees of Finite Graphs
- Graph decomposition with applications to subdivisions and path systems modulo k
- Kuratowski's theorem
- Covering contractible edges in 3‐connected graphs. I: Covers of size three are cutsets
- On induced subgraphs of a block
