A note on groups of colour preserving au
β
Ulrike Baumann; Ute Holthaus
π
Article
π
2011
π
John Wiley and Sons
π
English
β 233 KB
## Abstract A perfect edge colouring of a graph is defined by the property that all colour matchings are perfect matchings. Every edgeβcoloured graph determines a group of graph automorphisms which preserve the colours of the edges. If the graph is connected, then this group of colour preserving au