Edge partition of planar sraphs into two outerplanar graphs

Authors:
Daniel Gonçalves
Affiliations:
Université Bordeaux 1, Cedex, France
Venue:
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Year:
2005

Citing 5
Cited 6

Universal graphs and induced-universal graphs

Journal of Graph Theory
Hamiltonicity of 5-connected toroidal triangulations

Journal of Graph Theory
Outerplanar partitions of planar graphs

Journal of Combinatorial Theory Series B
On the Hajós number of graphs

Discrete Mathematics - Special issue on Selected Topics in Discrete Mathematics conferences
Surfaces, tree-width, clique-minors, and partitions

Journal of Combinatorial Theory Series B

Planar graphs are in 1-STRING

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Every planar graph is the intersection graph of segments in the plane: extended abstract

Proceedings of the forty-first annual ACM symposium on Theory of computing
Shorter implicit representation for planar graphs and bounded treewidth graphs

ESA'07 Proceedings of the 15th annual European conference on Algorithms
Decomposition, approximation, and coloring of odd-minor-free graphs

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Packing and squeezing subgraphs into planar graphs

MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Planar packing of binary trees

WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures

Quantified Score

Hi-index	0.00

Visualization

Abstract

An outerplanar graph is a planar graph that can be embedded in the plane without crossing edges, in such a way that all the vertices are on the outer boundary. In this paper, we prove a conjecture of Chartrand, Geller, and Hedetniemi that any planar graph G=(V,E) has a bipartition of its edge set E = A ∪ B such that the graphs induced by these subsets, G[A] and G[B], are outerplanar.