The following pages link to Kuratowski's theorem (Q3937423):
Displaying 28 items.
- Outer 1-planar graphs (Q289919) (← links)
- Deformations of plane graphs (Q595673) (← links)
- A refinement of Kuratowski's theorem (Q800369) (← links)
- Contractions, cycle double covers, and cyclic colorings in locally connected graphs (Q859615) (← links)
- How to contract an essentially 6-connected graph to a 5-connected graph (Q864138) (← links)
- A constructive characterization of 3-connected triangle-free graphs (Q875938) (← links)
- Single source shortest paths in \(H\)-minor free graphs (Q986535) (← links)
- The theorem on planar graphs (Q1071005) (← links)
- Open problems on graphs arising from geometric topology (Q1295323) (← links)
- Embeddings of graphs (Q1313840) (← links)
- The structure of quasi 4-connected graphs (Q1356425) (← links)
- Tutte's barycenter method applied to isotopies (Q1395577) (← links)
- Splitting and contractible edges in 4-connected graphs (Q1400957) (← links)
- Contractible non-edges in \(3\)-connected graphs (Q1569036) (← links)
- Border correlations, lattices, and the subgraph component polynomial (Q1678101) (← links)
- Contractible subgraphs in 3-connected graphs (Q1850482) (← links)
- Combinatorial games modeling seki in Go (Q2017043) (← links)
- Clique dynamics of locally cyclic graphs with \(\delta \geq 6\) (Q2138966) (← links)
- Contractible edges and removable edges in 3-connected graphs (Q2287731) (← links)
- The minimum number of minimal codewords in an \([n, k]\)-code and in graphic codes (Q2341750) (← links)
- Reduction for 3-connected graphs of minimum degree at least four (Q2373428) (← links)
- Construction sequences and certifying 3-connectivity (Q2428654) (← links)
- High connectivity keeping sets in graphs and digraphs (Q2575793) (← links)
- Induced paths in 5-connected graphs (Q2708795) (← links)
- Mondshein Sequences (a.k.a. (2,1)-Orders) (Q2832896) (← links)
- A Planarity Criterion for Graphs (Q3452159) (← links)
- Ideal spatial graph configurations (Q5047033) (← links)
- Relaxing the irrevocability requirement for online graph algorithms (Q5918715) (← links)
