2009
Excluding a group-labelled graph
Publication
Publication
Journal of Combinatorial Theory - Series B , Volume 99 - Issue 1 p. 247- 253
This paper contains a first step towards extending the Graph Minors Project of Robertson and Seymour to group-labelled graphs. For a finite abelian group Γ and Γ-labelled graph G, we describe the class of Γ-labelled graphs that do not contain a minor isomorphic to G.
| Additional Metadata | |
|---|---|
| , , , | |
| Academic Press | |
| Journal of Combinatorial Theory - Series B | |
| Matroid Structure for Efficiency | |
| Organisation | Probability, Networks and Algorithms |
|
Geelen, J., & Gerards, B. (2009). Excluding a group-labelled graph. Journal of Combinatorial Theory - Series B, 99(1), 247–253. |
|
