This work was partially supported by the ESPRIT Basic Research Action Nr. 7141 (ALCOM II).
Chapter PDF
References
H. de Fraysseix, J. Pach, and R. Pollack. Small sets supporting Fary embeddings of planar graphs. In Twentieth Annual ACM Symposium on Theory of Computing, pages 426–433, 1988.
K.P. Eswaran and R.E. Tarjan. Augmentation problems. SIAM J. Comput., 5:653–665, 1976.
G. Kant. Algorithms for Drawing Planar Graphs. Ph.D. thesis, Utrecht University, Utrecht, 1993.
C. St J. A. Nash-Williams. Edge-disjoint spanning trees of finite graphs. J. London Math. Soc., 36:445–450, 1961.
P. O. de Mendez. Orientations bipolaires. Ph.D. thesis, Ecole des Hautes Etudes en Sciences Sociales, Paris, 1994.
V. Petrović. Decomposition of some planar graphs into trees. In J. Bolyai Mathematical Society, editor, Proc. International Conference on Combinatorics, page 48, 1993.
V. Petrović, G. Ringel, and C. Thomassen. Decomposition of maximal graphs into trees. preprint, 1993.
G. Ringle. Two trees in maximal planar bipartite graphs. Journal of Graph Theory, 17(6):755–758, 1993.
W. Schnyder. Planar graphs and poset dimension. Order, 5:323–343, 1989.
W. Schnyder. Embedding planar graphs in the grid. In First ACM-SIAM Symposium on Discrete Algorithms, pages 138–147, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
de Fraysseix, H., de Mendez, P.O. (1995). Regular orientations, arboricity, and augmentation. In: Tamassia, R., Tollis, I.G. (eds) Graph Drawing. GD 1994. Lecture Notes in Computer Science, vol 894. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58950-3_362
Download citation
DOI: https://doi.org/10.1007/3-540-58950-3_362
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58950-1
Online ISBN: 978-3-540-49155-2
eBook Packages: Springer Book Archive