Graph Planarity and Related Topics

Thomas, Robin (1999) Graph Planarity and Related Topics. In: Graph Drawing 7th International Symposium, GD’99, September 15-19, 1999 , pp. 137-144(Official URL: http://dx.doi.org/10.1007/3-540-46648-7_14).

Full text not available from this repository.

Abstract

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.

Item Type: Conference Paper
Additional Information: 10.1007/3-540-46648-7_14
Classifications: Z Theory > Z.001 General
G Algorithms and Complexity > G.490 Embeddings
M Methods > M.600 Planar
G Algorithms and Complexity > G.770 Planarity Testing
URI: http://gdea.informatik.uni-koeln.de/id/eprint/303

Actions (login required)

View Item View Item