Trémaux trees and planarity
| dc.creator | De Fraysseix, Hubert | |
| dc.creator | De Mendez, Patrice Ossona | |
| dc.creator | Rosenstiehl, Pierre | |
| dc.date | 2006-10-30 | |
| dc.date.accessioned | 2026-07-07T07:29:38Z | |
| dc.date.available | 2026-07-07T07:29:38Z | |
| dc.description | We present a simplified version of the DFS-based Left-Right planarity testing and embedding algorithm implemented in Pigale which has been considered as the fastest implemented one [J.M. Boyer, P.F. Cortese, M. Patrignani, and G. Di Battista. Stop minding your P's and Q's: implementing fast and simple DFS-based planarity and embedding algorithm. In Graph Drawing, volume 2912 of Lecture Notes in Computer Science, pages 25-36. Springer, 2004.]. We give here a simple full justification of the algorithm, based on a preliminary extended study of topological properties of DFS trees. | |
| dc.description | Special Issue on Graph Drawing | |
| dc.identifier | https://arxiv.org/abs/math/0610935 | |
| dc.identifier | http://arxiv.org/abs/math/0610935 | |
| dc.identifier | International Journal of Foundations of Computer Science 17 (5) (2006) 1017-1029 | |
| dc.identifier | doi:10.1142/S0129054106004248 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/118184 | |
| dc.subject | Combinatorics | |
| dc.subject | 05C10, 05C85, 05C75 | |
| dc.title | Trémaux trees and planarity | |
| dc.type | text |