Partitions of Graphs into Trees
Biedl, Therese and Brandenburg, Franz J. (2007) Partitions of Graphs into Trees. In: Graph Drawing 14th International Symposium, GD 2006, September 18-20, 2006, Karlsruhe, Germany , pp. 430-439 (Official URL: http://dx.doi.org/10.1007/978-3-540-70904-6_41).
Full text not available from this repository.
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) x (n-2) area planar straight line drawing of maximal planar graphs using Schnyder's realizers }, which are a 3-tree partition of the inner edges. Maximal planar bipartite graphs have a 2-tree partition, as shown by Ringel . Here we give a different proof of this result with a linear time algorithm. The algorithm makes use of a new ordering which is of interest of its own. Then we establish the NP-hardness of the k-tree partition problem for general graphs and k >= 2. This parallels NP-hard partition problems for the vertices , but it contrasts the efficient computation of partitions into forests (also known as arboricity) by matroid techniques .
Repository Staff Only: item control page