%0 Journal Article %1 baumann:1997-2 %A Baumann, U. %D 1997 %J Math. Nachr. %K colouredgraph permutationgroup %P 17--22 %T Representing groups by colourings of graphs. %V 188 %X The following result is established: Given a group $H$, there exists an $r$-regular graph $G$ such that every subgroup of $H$ (including $H$ itself) is isomorphic to the group $\Aut(G,\varphi)$ of all automorphisms preserving a certain proper $r$-edge-colouring $\varphi$ of $G$. If the group is finite, so is the graph.

@article{baumann:1997-2, abstract = {{The following result is established: Given a group $H$, there exists an $r$-regular graph $G$ such that every subgroup of $H$ (including $H$ itself) is isomorphic to the group $\Aut(G,\varphi)$ of all automorphisms preserving a certain proper $r$-edge-colouring $\varphi$ of $G$. If the group is finite, so is the graph.}}, added-at = {2011-08-05T18:15:18.000+0200}, author = {Baumann, U.}, biburl = {https://www.bibsonomy.org/bibtex/28b9f8d56c1b31b6e4ca1eab4265d640f/ulpsch}, interhash = {f643ca0664f180adf4e02264e0f0638e}, intrahash = {8b9f8d56c1b31b6e4ca1eab4265d640f}, journal = {Math. Nachr.}, keywords = {colouredgraph permutationgroup}, pages = {17--22}, timestamp = {2012-01-16T16:25:28.000+0100}, title = {Representing groups by colourings of graphs.}, volume = 188, year = 1997 }