Contractible subgraphs in 3-connected graphs
From MaRDI portal
Publication:1850482
DOI10.1006/JCTB.2000.1960zbMATH Open1024.05051OpenAlexW2042939975MaRDI QIDQ1850482FDOQ1850482
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
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the Problem of Decomposing a Graph into n Connected Factors
- Edge-Disjoint Spanning Trees of Finite Graphs
- Kuratowski's theorem
- Generalizaions of critical connectivity of graphs
- Graph decomposition with applications to subdivisions and path systems modulo k
- On induced subgraphs of a block
- Induced paths in 5-connected graphs
- Covering contractible edges in 3‐connected graphs. I: Covers of size three are cutsets
- Zur Theorie der n-fach zusammenhängenden Graphen
- Contractible triples in 3-connected graphs
- Contractible edges in 3-connected graphs
Cited In (18)
- Almost all 3-connected graphs contain a contractible set of \(k\) vertices
- An extremal problem on contractible edges in 3-connected graphs
- Large contractible subgraphs of a 3-connected graph
- On the number of contractible triples in 3-connected graphs
- On \(k\)-con-critically \(n\)-connected graphs
- Contractible small subgraphs in \(k\)-connected graphs
- Induced paths in 5-connected graphs
- On contractible 5-vertex subgraphs of a 3-connected graph
- High connectivity keeping sets in graphs and digraphs
- On small contractible subgraphs in 3-connected graphs of small average degree
- Contractions, cycle double covers, and cyclic colorings in locally connected graphs
- Contractible triples in highly connected graphs
- Contractible and removable edges in 3-connected infinite graphs
- An included-minor result for 3-connected graphs with contractible edges
- On the number of noncritical vertices in strongly connected digraphs
- On contractible and vertically contractible elements in 3-connected matroids and graphs
- Reduction for 3-connected graphs of minimum degree at least four
- A connected subgraph maintaining high connectivity
Recommendations
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Contractible triples in 3-connected graphs 👍 👎
- Contractible small subgraphs in \(k\)-connected graphs 👍 👎
- Contractible edges in 3-connected graphs 👍 👎
- Contractible non-edges in \(3\)-connected graphs 👍 👎
- Contractible circuits in \(3\)-connected graphs 👍 👎
- Contractible Edges in 3-Connected Cubic Graphs 👍 👎
- Large contractible subgraphs of a 3-connected graph 👍 👎
- Contractible subgraphs ink-connected 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)
