Wagner's theorem on realizers

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2380 LNCS, Issue , 2002, Pages 1043-1053

  Bonichon, Nicolas ^a   Le Saëc, Bertrand ^a   Mosbah, Mohamed ^a  

^a UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; DRAWING (GRAPHICS);

GRAPH ALGORITHMS; GRAPH DRAWING ALGORITHMS; LINEAR TIME; PLANAR GRAPH; PLANE GRAPHS; SPANNING TREE;

TREES (MATHEMATICS);

EID: 84869177769     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45465-9_89     Document Type: Conference Paper

References (16)

1. E. Brehm. 3-orientations and Schnyder 3-tree-decompositions. PhD thesis, FB Mathematik und Informatik, Freie Universität Berlin, 2000.
2. Yi-Ting Chiang Ching-Chi and Hsueh-I Lu. Orderly spanning trees with applications to graph encoding and graph drawing. In Proc. 12th Symp. Discrete Algorithms, pages 506-515. ACM and SIAM, 2001.
3. Richie Chih-Nan Chuang, Ashim Garg, Xin He, Ming-Yang Kao, and Hsueh-I Lu. Compact encodings of planar graphs via canonical ordering and multiple parentheses. In Proc. 25th International Colloquium on Automata, Languages, and Programming (ICALP'98), volume 1443, pages 118-129, 1998.
4. P. Ossona de Mendez. Orientations bipolaires. PhD thesis, Ecole des Hautes Etudes en Sciences Sociales, 1994.
5. A. K. Dewdney. Wagner's theorem for torus graphs. Discrete Math., 4:139-149, 1973.
6. S. Eliahou. Signed diagonal flips and the four color theorem. Europ. J. Combinatorics, 20:641-646, 1999.
7. S. Eliahou, S. Gravier, and C. Payan. Three moves on signed surface triangulations. Les cahiers du laboratoire leibniz, 2000.
8. I. Fary. On straight lines representation of planar graphs. Acta Sci. Math. Szeged, 11:229-233, 1948.
9. H. De Frayseix, J. Pach, and J. Pollack. How to draw a planar graph on a grid. Combinatorica, 10:41-51, 1990.
10. S. Gravier and C. Payan. Flips signés et triangulations d'un polygone. Les cahiers du laboratoire leibniz, 2000.
11. G. Kant. Drawing planar graphs using the canonical ordering. Algorithmica, 16:4-32, 1996.
12. P. Rosenstiehl and R.E. Tarjan. Rectilinear planar layouts and bipolar orientations of planar graphs. Discrete Comput. Geom., 1:343-353, 1986.
13. W. Schnyder. Planar graphs and poset dimension. Order, 5:323-343, 1989.
14. W. Schnyder. Embedding planar graphs on the grid. Proc. 1st ACM-SIAM Symp. Discrete Algorithms, pages 138-148, 1990.
15. S.K. Stein. Convex maps. In Proc. Amer. Math. Soc., volume 2, pages 464-466, 1951.
16. K. Wagner. Bemerkungen zum Vierfarbenproblem. In Jahresber. Deutsche Math.- Verein., volume 46, pages 26-32, 1936.