Logo

Login | Create Account

Regular Orientations, Arboricity, and Augmentation

de Fraysseix, Hubert and Ossona de Mendez, Patrice (1995) Regular Orientations, Arboricity, and Augmentation. [Conference Paper]

Full text not available from this repository.

Abstract

-

Item Type:Conference Paper
Classifications:M Methods > M.600 Planar
G Algorithms and Complexity > G.140 Augmentation
Z Theory > Z.999 Others
ID Code:118
Deposited By:Selbach, Anna
Deposited On:25 Nov 2004
Last Modified:18 Sep 2008 13:08

Repository Staff Only: item control page

References

H. de Fraysseix, J. Pach, and R. Pollack. Small sets supporting Fary embeddings of planar graphs. In Twentieth Annual ACM Symposium on Theoty 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. Petrovic. Decomposition of some planar graphs into trees. In J. Bolyai Mathematical Society, editor, Proc. International Conference on Combinatorics, page 48, 1993.

V. Petrovic, 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.

GDEA is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.