Daniel Gonçalves
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.
- Richard Brunet and R. Bruce Richter. Hamiltonicity of 5-connected toroidal triangulations. J. Graph Theory, 20(3):267--286, 1995. Google Scholar
Digital Library
- G. Chartrand, D. Geller, and S.Hedetniemi. Graphs with forbidden subgraphs. J. Combinatorial Theory Ser. B, 10:12--41, 1971.Google ScholarCross Ref
- F. R. K. Chung. Universal graphs and induced-universal graphs. J. Graph Theory, 14(4):443--454, 1990. Google ScholarDigital Library
- G. Ding, B. Oporowski, D. P. Sanders, and D. Vertigan. Surfaces, tree-width, clique-minors, and partitions. J. Combin. Theory Ser. B, 79(2):221--246, 2000. Google ScholarDigital Library
- E. S. El-Mallah and C. J. Colbourn. Partitioning the edges of a planar graph into two partial k-trees. Congr. Numer., 66:69--80, 1988. Nineteenth Southeastern Conference on Combinatorics, Graph Theory, and Computing (Baton Rouge, LA, 1988).Google Scholar
- Daniel Gonçalves. On the caterpillar arboricity of planar graphs. Discrete Math., to appear.Google Scholar
- Daniel Gonçalves and Pascal Ochem. On some arboricities in planar graphs. submitted, 2005.Google Scholar
- G. Gutin, A. V. Kostochka, and B. Toft. On the Hajós number of graphs. Discrete Math., 213(1-3):153--161, 2000. Selected topics in discrete mathematics (Warsaw, 1996). Google ScholarDigital Library
- T. R. Jensen and B. Toft. Graph coloring problems. Wiley-Interscience Series in Discrete Mathematics and Optimization. John Wiley & Sons Inc., New York, 1995. A Wiley-Interscience Publication.Google Scholar
- K. S. Kedlaya. Outerplanar partitions of planar graphs. J. Combin. Theory Ser. B, 67(2):238--248, 1996. Google ScholarDigital Library
- Alexandr V. Kostochka and Douglas B. West. Every outerplanar graph is the union of two interval graphs. In Proceedings of the Thirtieth Southeastern International Conference on Combinatorics, Graph Theory, and Computing (Boca Raton, FL, 1999), volume 139, pages 5--8, 1999.Google Scholar
- P. Mutzel, T. Odenthal, and M. Scharbrodt. The thickness of graphs: a survey. Graphs Combin., 14(1):59--73, 1998.Google ScholarCross Ref
- C. St. J. A. Nash-Williams. Decomposition of finite graphs into forests. J. London Math. Soc., 39:12, 1964.Google ScholarCross Ref
- W. T. Tutte. A theorem on planar graphs. Trans. Amer. Math. Soc., 82:99--116, 1956.Google ScholarCross Ref
- V. G. Vizing. On an estimate of the chromatic class of a p-graph. Diskret. Analiz No., 3:25--30, 1964.Google Scholar
- H. Whitney. A theorem on graphs. Ann. of Math. (2), 32(2):378--390, 1931.Google ScholarCross Ref
Index Terms
- Edge partition of planar sraphs into two outerplanar graphs
Recommendations
Small Drawings of Outerplanar Graphs, Series-Parallel Graphs, and Other Planar Graphs
In this paper, we study small planar drawings of planar graphs. For arbitrary planar graphs, ź(n2) is the established upper and lower bound on the worst-case area. A long-standing open problem is to determine for what graphs a smaller area can be ...
Covering planar graphs with forests, one having bounded maximum degree
We prove that every planar graph has an edge partition into three forests, one having maximum degree at most 4. This answers a conjecture of Balogh, Kochol, Pluhar and Yu [J. Balogh, M. Kochol, A. Pluhar, X. Yu, Covering planar graphs with forests, J. ...
Total domination in planar graphs of diameter two
MacGillivary and Seyffarth [G. MacGillivray, K. Seyffarth, Domination numbers of planar graphs, J. Graph Theory 22 (1996) 213-229] proved that planar graphs of diameter two have domination number at most three. Goddard and Henning [W. Goddard, M.A. ...
Comments