Partitions of Graphs into Trees

In this paper, we study the k-tree partition problem which is a partition of the set of edges of a graph into k edge-disjoint trees. This problem occurs at several places with applications e.g. in network reliability and graph theory. In graph drawing there is the still unbeaten (n - 2)

• Type: Conference
• Year: 2006
• Where: GD
• Authors: Therese C. Biedl, Franz-Josef Brandenburg
• Keywords: Computer Graphics, GD 2006, K-tree Partition Problem, Maximal Planar, Maximal Planar Graphs