%0 Journal Article %1 baumann:1993 %A Baumann, U. %D 1993 %J Math. Nachr. %K automorphismgroup colouredgraph edgecolouring permutationgroup %P 93--100 %T Symmetry groups of coloured graphs. %V 163 %X Summary: A perfect colouring $\varphi$ of a simple undirected connected graph $G$ is an edge colouring such that each vertex is incident with exactly one edge of each colour. This paper concerns the problem of representing groups by graphs with perfect colourings. We define groups of graph automorphisms, which preserve the structure of the colouring, and characterize these groups up to isomorphism. Our considerations are based on the fact that every perfectly coloured graph is isomorphic to a Schreier coset graph on a group generated by involutions.

@article{baumann:1993, abstract = {{Summary: A perfect colouring $\varphi$ of a simple undirected connected graph $G$ is an edge colouring such that each vertex is incident with exactly one edge of each colour. This paper concerns the problem of representing groups by graphs with perfect colourings. We define groups of graph automorphisms, which preserve the structure of the colouring, and characterize these groups up to isomorphism. Our considerations are based on the fact that every perfectly coloured graph is isomorphic to a Schreier coset graph on a group generated by involutions.}}, added-at = {2011-08-05T18:16:05.000+0200}, author = {Baumann, U.}, biburl = {https://www.bibsonomy.org/bibtex/298ed36a9ba41842c727d712577bf5212/ulpsch}, interhash = {7a92194fa74d35c76567fc6e088fb5ce}, intrahash = {98ed36a9ba41842c727d712577bf5212}, journal = {Math. Nachr.}, keywords = {automorphismgroup colouredgraph edgecolouring permutationgroup}, pages = {93--100}, timestamp = {2012-01-16T16:26:46.000+0100}, title = {Symmetry groups of coloured graphs.}, volume = 163, year = 1993 }