Partitions of graphs into trees

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

Volumn 4372 LNCS, Issue , 2007, Pages 430-439

  Biedl, Therese ^a   Brandenburg, Franz J ^b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b UNIVERSITY OF PASSAU   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; NUMERICAL METHODS; PROBLEM SOLVING;

BIPARTITE GRAPHS; SCHNYDER'S REALIZERS;

GRAPH THEORY;

EID: 34547659173     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70904-6_41     Document Type: Conference Paper

References (15)

1. T. Biedl and F. J. Brandenburg. Drawing planar bipartite graphs with small area. In Proc. 17th Canadian Conference on Computational Geometry, CCCG'05, University of Windsor, Ontario, Canada, August 10-1, 2005, volume 17, 2005.
2. A. Brandstädt, V. B. Le, and T. Symczak. The complexity of some problems related to graph 3-colorability. Disc. Appl. Math., 89(1):59-73, 1998.
3. H. Broersma, F. V. Fomin, J. Kratochvil, and G. J. Woeginger. Planar graph coloring avoiding monochromatic subgraphs: Trees and paths make it difficult. Algorithmica, 44:343-361, 2006.
4. H. de Fraysseix, P. O. de Mendez, and J. Pach. Representation of planar graphs by segments. Intuitive Geometry, 63:109-117, 1991.
5. H. de Fraysseix, J. Pach, and R. Pollack. How to draw a planar graph on a grid. Combinatorica, 10:41-51, 1990.
6. S. Even and R. E. Tarjan. Computing an st-numbering. Theoretical Computer Science, 2:436-441, 1976.
7. H. N. Gabow and H. H. Westermann. Forests, frames, and games: Algorithms for matroid sums and applications. Algorithmica, 7:465-497, 1992.
8. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, San Francisco, 1979.
9. G. Kant. Drawing planar graphs using the canonical ordering. Algorithmica, 16:4-32, 1996.
10. A. Lempel, S. Even, and I. Cederbaum. An algorithm for planarity testing of graphs. In Theory of Graphs, International Symposium Rome 1966, pages 215-232. Gordon and Breach, 1967.
11. C. S. J. Nash-Williams. Edge-disjoint spanning trees of finite graphs. J. London Math. Soc., 36:445-450, 1961.
12. C. S. J. Nash-Williams. Decomposition of finite graphs into forests. J. London Math. Soc., 39:12, 1964.
13. C. Papadimitriou. Computational Complexity. Addison Wesley, Reading MA, 1994.
14. G. Ringel. Two trees in maximal planar bipartite graphs. J. Graph Theory, 17: 755-758, 1993.
15. W. Schnyder. Embedding planar graphs on the grid. In 1st Annual ACM-SIAM Symposium on Discrete Algorithms, pages 138-148, 1990.