Contractible Subgraphs in 3-Connected Graphs
Author:
- Matthias KriesellMKMatthias Kriesell
- 1 September 2000
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 80 (1) , 32-48
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Contractile Triples in 3-Connected GraphsJournal of Combinatorial Theory, Series B, 1994
- Covering contractible edges in 3-connected graphs. I: Covers of size three are cutsetsJournal of Graph Theory, 1990
- Generalizations of critical connectivity of graphsDiscrete Mathematics, 1988
- Contractible edges in 3-connected graphsJournal of Combinatorial Theory, Series B, 1987
- Graph decomposition with applications to subdivisions and path systems modulo kJournal of Graph Theory, 1983
- Kuratowski's theoremJournal of Graph Theory, 1981
- On induced subgraphs of a blockJournal of Graph Theory, 1977
- Zur Theorie dern-fach zusammenhängenden GraphenAbhandlungen aus dem Mathematischen Seminar der Universitat Hamburg, 1969
- On the Problem of Decomposing a Graph into n Connected FactorsJournal of the London Mathematical Society, 1961
- Edge-Disjoint Spanning Trees of Finite GraphsJournal of the London Mathematical Society, 1961