Generating internally four-connected graphs
From MaRDI portal
Publication:1850601
DOI10.1006/jctb.2001.2089zbMath1028.05053OpenAlexW2122588376MaRDI QIDQ1850601
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/57602f82cb20c6b1ff6bd8aacb9fb602da4ce6bc
minorsubdivisionwheelMöbius ladderladderinternally 4-connectedhomeomorphic embeddingbiwheelsplitting a vertex
Related Items
Towards a splitter theorem for internally 4-connected binary matroids. IX. The theorem. ⋮ Non-planar extensions of subdivisions of planar graphs ⋮ Some recent progress and applications in graph minor theory ⋮ Towards a splitter theorem for internally 4-connected binary matroids. III ⋮ Towards a splitter theorem for internally 4-connected binary matroids. IV ⋮ Towards a splitter theorem for internally 4-connected binary matroids. V ⋮ Graphs with no 7-wheel subdivision ⋮ Towards a splitter theorem for internally 4-connected binary matroids. VII ⋮ Towards a splitter theorem for internally 4-connected binary matroids. VIII: Small matroids. ⋮ Generating weakly 4-connected matroids ⋮ A chain theorem for internally 4-connected binary matroids ⋮ Towards a splitter theorem for internally 4-connected binary matroids. VI ⋮ Linear connectivity forces large complete bipartite minors ⋮ A Characterization of Graphs with No Octahedron Minor ⋮ Matroid 4-connectivity: A deletion-contraction theorem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The structure of graphs not topologically containing the Wagner graph
- Bemerkungen zu Hadwigers Vermutung
- The spherical genus and virtually planar graphs
- Homomorphiebasen von Graphenmengen
- Decomposition of regular matroids
- The structure of quasi 4-connected graphs
- Matroid 4-connectivity: A deletion-contraction theorem
- Cyclically five-connected cubic graphs
- Zur Klassifikation der endlichen Graphen nach H. Hadwiger und K. Wagner
- Über einen Satz von K.Wagner zum Vierfarbenproblem
- Minimal Cyclic-4-Connected Graphs
- Characterization and Recognition of Partial 3-Trees
- On possible counterexamples to Negami's planar cover conjecture