Generating internally four-connected graphs

DOI10.1006/JCTB.2001.2089MaRDI QIDQ1850601zbMATH OpenOpenAlexFDO

Authors Thor Johnson, Robin Thomas

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

zbMATH Keywords

minor[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=M%EF%BF%BD%EF%BF%BDbius+ladder&go=Go M��bius ladder]wheelsubdivisionladderinternally 4-connectedhomeomorphic embeddingbiwheelsplitting a vertex

Mathematics Subject Classification ID

Connectivity (05C40)

Recommendations

• Typical subgraphs of 3- and 4-connected graphs
• Internally 4-connected graphs with no \(\{\text{cube}, V_8\}\)-minor
• scientific article; zbMATH DE number 512928
• Minimally 3-connected graphs with exactly \(k\) non-essential edges
• Odd \(K_{3,3}\) subdivisions in bipartite graphs
• Minimally 3-connected graphs
• Nonseparating K₄‐subdivisions in graphs of minimum degree at least 4
• Minimal Cyclic-4-Connected Graphs
• On the decomposition of a 3-connected graph into cyclically 4-edge-connected components
• scientific article; zbMATH DE number 1342090

Cites work

• scientific article; zbMATH DE number 3166039 (Why is no real title available?)
• scientific article; zbMATH DE number 4008436 (Why is no real title available?)
• scientific article; zbMATH DE number 3026377 (Why is no real title available?)
• Bemerkungen zu Hadwigers Vermutung
• Characterization and Recognition of Partial 3-Trees
• Cyclically five-connected cubic graphs
• Decomposition of regular matroids
• Homomorphiebasen von Graphenmengen
• Matroid 4-connectivity: A deletion-contraction theorem
• Minimal Cyclic-4-Connected Graphs
• On possible counterexamples to Negami's planar cover conjecture
• The spherical genus and virtually planar graphs
• The structure of graphs not topologically containing the Wagner graph
• The structure of quasi 4-connected graphs
• Zur Klassifikation der endlichen Graphen nach H. Hadwiger und K. Wagner
• Über einen Satz von K.Wagner zum Vierfarbenproblem

Cited in

(18)

• Towards a splitter theorem for internally 4-connected binary matroids. VII
• Generating weakly 4-connected matroids
• Towards a splitter theorem for internally 4-connected binary matroids. VIII: Small matroids.
• A characterization of graphs with no octahedron minor
• 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
• Towards a splitter theorem for internally 4-connected binary matroids. VI
• Unavoidable parallel minors of 4-connected graphs
• Some recent progress and applications in graph minor theory
• Internally 4-connected graphs with no \(\{\text{cube}, V_8\}\)-minor
• Linear connectivity forces large complete bipartite minors
• A chain theorem for internally 4-connected binary matroids
• A constructive characterization of 4-connected graphs
• Graphs with no 7-wheel subdivision
• Matroid 4-connectivity: A deletion-contraction theorem
• Non-planar extensions of subdivisions of planar graphs
• Towards a splitter theorem for internally 4-connected binary matroids. IX. The theorem.

This page was built for publication: Generating internally four-connected graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1850601)