## DIMACS TR: 93-62

## Minors and the Chromatic Index of r-graphs

### Authors: K.Kilakos, B. Shepherd

**
ABSTRACT
**

Let T be the graph obtained from the Petersen Graph
by first deleting a vertex and then contracting an edge incident to
a vertex of degree two. We give a simple characterization
of graphs with no minor isomorphic to T. This is used to show that
if every planar r-graph is r-edge colourable, then so
is any T-free r-graph

Paper available at:
ftp://dimacs.rutgers.edu/pub/dimacs/TechnicalReports/TechReports/1993/93-62.ps

DIMACS Home Page