Document Type
Article
Publication Date
10-16-2015
Abstract
If X is a collection of edges in a graph G, let G/X denote the contraction of X. Following a question of Oxley and a conjecture of Oporowski, we prove that every projective-planar graph G admits an edge-partition {X,Y} such that G/X and G/Y have tree-width at most three. We prove that every toroidal graph G admits an edge-partition {X,Y} such that G/X and G/Y have tree-width at most three and four, respectively.
Publication Source (Journal or Book title)
Electronic Journal of Combinatorics
Recommended Citation
Morgan, E., & Oporowski, B. (2015). Bounding tree-width via contraction on the projective plane and torus. Electronic Journal of Combinatorics, 22 (4) https://doi.org/10.37236/2534
COinS