Show simple item record

Graph with given automorphism group and given chromatic index

dc.creatorMontenegro, Eduardo
dc.date1991-12-01
dc.date.accessioned2019-05-03T12:37:01Z
dc.date.available2019-05-03T12:37:01Z
dc.identifierhttp://revistas.ufro.cl/ojs/index.php/cubo/article/view/1827
dc.identifier.urihttp://revistaschilenas.uchile.cl/handle/2250/84551
dc.descriptionIn 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.en-US
dc.formatapplication/pdf
dc.languageeng
dc.publisherUniversidad de La Frontera. Temuco, Chile.en-US
dc.relationhttp://revistas.ufro.cl/ojs/index.php/cubo/article/view/1827/1677
dc.sourceCUBO, A Mathematical Journal; Núm. 7 (1991): CUBO, Revista de Matemática; 33–41es-ES
dc.sourceCUBO, A Mathematical Journal; No 7 (1991): CUBO, Revista de Matemática; 33–41en-US
dc.source0719-0646
dc.source0716-7776
dc.titleGraph with given automorphism group and given chromatic indexen-US
dc.typeinfo:eu-repo/semantics/article
dc.typeinfo:eu-repo/semantics/publishedVersion


This item appears in the following Collection(s)

Show simple item record