Title

Surfaces, Tree-Width, Clique-Minors, and Partitions

Document Type

Article

Publication Date

7-1-2000

Abstract

In 1971, Chartrand, Geller, and Hedetniemi conjectured that the edge set of a planar graph may be partitioned into two subsets, each of which induces an outerplanar graph. Some partial results towards this conjecture are presented. One such result, in which a planar graph may be thus edge partitioned into two series-parallel graphs, has nice generalizations for graphs embedded onto an arbitrary surface and graphs with no large clique-minor. Several open questions are raised. © 2000 Academic Press.

Publication Source (Journal or Book title)

Journal of Combinatorial Theory. Series B

First Page

221

Last Page

246

This document is currently not available here.

Share

COinS