This compendium is the result of reformatting and minor editing of the author's transparencies for his talk delivered at the conference. The talk covered Euler's Formula, Kuratowski's Theorem, linear planarity tests, Schnyder's Theorem and drawing on the grid, the two paths problem, Pfaffian orientations, linkless embeddings, and the Four Color Theorem.
CITATION STYLE
Thomas, R. (1999). Graph planarity and related topics. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1731, pp. 137–144). Springer Verlag. https://doi.org/10.1007/3-540-46648-7_14
Mendeley helps you to discover research relevant for your work.