Excluding a group-labelled graph

Authors:
Jim Geelen;Bert Gerards
Affiliations:
Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Canada N2L 3G1;CWI, Postbus 94079, 1090 GB Amsterdam, The Netherlands and Department of Mathematics and Computer Science, Eindhoven University of Technology, Postbus 513, 5600 MB Eindhoven, The Netherlands
Venue:
Journal of Combinatorial Theory Series B
Year:
2009

Citing 9
Cited 0

Biased graphs. I. Bias, balance, and gains

Journal of Combinatorial Theory Series B - Series B
Biased graphs. II.: The three matroids

Journal of Combinatorial Theory Series B
Graph minors: X. obstructions to tree-decomposition

Journal of Combinatorial Theory Series B
Graph minors. XIII: the disjoint paths problem

Journal of Combinatorial Theory Series B
Graph minors. XVI. excluding a non-planar graph

Journal of Combinatorial Theory Series B
Graph Minors. XX. Wagner's conjecture

Journal of Combinatorial Theory Series B - Special issue dedicated to professor W. T. Tutte
Packing Non-Zero A-Paths In Group-Labelled Graphs

Combinatorica
An algorithm for packing non-zero A-paths in group-labelled graphs

Combinatorica
On the odd-minor variant of Hadwiger's conjecture

Journal of Combinatorial Theory Series B

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 @C and @C-labelled graph G, we describe the class of @C-labelled graphs that do not contain a minor isomorphic to G.