In 1938, Frucht [2] proved that every finite group may be represented by a graph, that is to say, given any finite group H, there is a graph G whose automorphism group is isomorphic to H. This paper pretends to prove that for every finite group H and for every positive integer number n ≥ 3, there exists a graph G, that represents H and whose chromatic index is n.
@article{1827,
title = {Graph with given automorphism group and given chromatic index},
journal = {CUBO, A Mathematical Journal},
year = {1991},
language = {en},
url = {http://dml.mathdoc.fr/item/1827}
}
Montenegro, Eduardo. Graph with given automorphism group and given chromatic index. CUBO, A Mathematical Journal, (1991), . http://gdmltest.u-ga.fr/item/1827/