Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4647115 | Discrete Mathematics | 2016 | 5 Pages |
Abstract
The fact that K4-minor-free graphs are characterized as series-parallel networks leads to an easy proof that they are all 3-colorable. We show how to extend this argument to a particular subclass of M(K4)-minor-free oriented matroids. Specifically we generalize the notion of being series-parallel to oriented matroids, and then show that generalized series-parallel oriented matroids are 3-colorable. To illustrate the method, we show that every orientation of a bicircular matroid is 3-colorable.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Luis Goddyn, Winfried Hochstättler, Nancy Ann Neudauer,