Kuratowski chains

DOI10.1006/JCTB.1995.1030zbMATH Open0832.05030OpenAlexW2911779984MaRDI QIDQ1898717FDOQ1898717

Authors: Neil Robertson, Robin Thomas, Paul Seymour 

Publication date: 20 September 1995

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1995.1030

Recommendations

• Independent paths and \(K_{5}\)-subdivisions
• A strengthening of the Kuratowski planarity criterion for 3-connected graphs
• A refinement of Kuratowski's theorem
• The Kelmans-Seymour conjecture. IV: A proof
• scientific article; zbMATH DE number 3887721

zbMATH Keywords

subdivisionsseparationlinkless embeddingembedding conjectureKuratowski chains

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40) Structural characterization of families of graphs (05C75)

Cited In (11)

• Linkless embeddings of graphs in 3-space
• Elimination of local bridges
• All minor-minimal apex obstructions with connectivity two
• Linkless and flat embeddings in 3-space
• A polynomial-time algorithm to find a linkless embedding of a graph
• Knots and links in spatial graphs: a survey
• On Linked Spatial Representations
• Some recent progress and applications in graph minor theory
• A refinement of Kuratowski's theorem
• Path transferability of graphs
• Another Bruen chain

This page was built for publication: Kuratowski chains

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