Kuratowski's theorem
From MaRDI portal
Publication:3937423
DOI10.1002/jgt.3190050304zbMath0481.05023OpenAlexW2070459622WikidataQ56092458 ScholiaQ56092458MaRDI QIDQ3937423
Publication date: 1981
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190050304
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items (28)
Outer 1-planar graphs ⋮ Ideal spatial graph configurations ⋮ Reduction for 3-connected graphs of minimum degree at least four ⋮ Clique dynamics of locally cyclic graphs with \(\delta \geq 6\) ⋮ A Planarity Criterion for Graphs ⋮ The structure of quasi 4-connected graphs ⋮ Contractions, cycle double covers, and cyclic colorings in locally connected graphs ⋮ How to contract an essentially 6-connected graph to a 5-connected graph ⋮ Deformations of plane graphs ⋮ A constructive characterization of 3-connected triangle-free graphs ⋮ Induced paths in 5-connected graphs ⋮ Border correlations, lattices, and the subgraph component polynomial ⋮ Tutte's barycenter method applied to isotopies ⋮ Splitting and contractible edges in 4-connected graphs ⋮ Construction sequences and certifying 3-connectivity ⋮ Combinatorial games modeling seki in Go ⋮ Single source shortest paths in \(H\)-minor free graphs ⋮ Contractible edges and removable edges in 3-connected graphs ⋮ Relaxing the irrevocability requirement for online graph algorithms ⋮ Mondshein Sequences (a.k.a. (2,1)-Orders) ⋮ Contractible non-edges in \(3\)-connected graphs ⋮ Open problems on graphs arising from geometric topology ⋮ High connectivity keeping sets in graphs and digraphs ⋮ Contractible subgraphs in 3-connected graphs ⋮ The minimum number of minimal codewords in an \([n, k\)-code and in graphic codes] ⋮ A refinement of Kuratowski's theorem ⋮ Embeddings of graphs ⋮ The theorem on planar graphs
Cites Work
This page was built for publication: Kuratowski's theorem
