# On the Kuratowski graph planarity criterion

@article{Skopenkov2008OnTK, title={On the Kuratowski graph planarity criterion}, author={Arkadiy Skopenkov}, journal={ArXiv}, year={2008}, volume={abs/0802.3820} }

This paper is purely expositional. The statement of the Kuratowski graph planarity criterion is simple and well-known. However, its classical proof is not easy. In this paper we present the Makarychev proof (with further simplifications by Prasolov, Telishev, Zaslavski and the author) which is possibly the simplest. In the Rusian version before the proof we present all the necessary definitions, and afterwards we state some close results on graphs and more general spaces. The paper is…

## 5 Citations

A Planarity Criterion for Graphs

- MathematicsSIAM J. Discret. Math.
- 2015

It is proved that a connected graph is planar if and only if all its cocycles with at least four edges are “grounded” in the graph. The notion of grounding of this planarity criterion, which is…

Combinatorics of embeddings

- Mathematics
- 2011

We offer the following explanation of the statement of the Kuratowski graph planarity criterion and of 6/7 of the statement of the Robertson-Seymour-Thomas intrinsic linking criterion. Let us call a…

G T ] 2 5 M ay 2 01 8 Invariants of graph drawings in the plane

- Mathematics
- 2018

We present a simplified exposition of some classical and modern results on graph drawings in the plane. These results are chosen so that they illustrate some spectacular recent higher-dimensional…

Surveys in Contemporary Mathematics: Embedding and knotting of manifolds in Euclidean spaces

- Mathematics
- 2007

A clear understanding of topology of higher-dimensional objects is important in many branches of both pure and applied mathematics. In this survey we attempt to present some results of…

Invariants of Graph Drawings in the Plane

- MathematicsArXiv
- 2018

A simplified exposition of some classical and modern results on graph drawings in the plane, as an introduction to starting ideas of algebraic topology motivated by algorithmic, combinatorial and geometric problems.

## References

SHOWING 1-6 OF 6 REFERENCES

Surveys in Contemporary Mathematics: Embedding and knotting of manifolds in Euclidean spaces

- Mathematics
- 2007

A clear understanding of topology of higher-dimensional objects is important in many branches of both pure and applied mathematics. In this survey we attempt to present some results of…

Algebraic topology from geometric viewpoint

- Mathematics
- 2008

This book is expository and is in Russian. It is shown how in the course of solution of interesting geometric problems (close to applications) naturally appear main notions of algebraic topology…

Topological Immersion of Peanian Continua in a Spherical Surface

- Mathematics
- 1934

In 1930 Kuratowski2 established the following result: THEOREM A: A peanian continuum,3 containing but a finite number of simple closed curves, is homneomorphic with a subset of the plane, provided…

103 Graphs that are irreducible for the projective plane

- MathematicsJ. Comb. Theory, Ser. B
- 1979

103 graphs that are irredu ible for theproje tive plane

- J . Comb . Th .
- 1966