We define the automorphic H-chromatic index of a graph G as the minimum integer m for which G has a proper edge-coloring with m colors which is preserved by a given automorphism group H of G. After the description of some properties, we determine upper bounds for this index when H is a cyclic group of prime order. We also show that these upper bounds are best possible in a number of istances.
On the automorphic chromatic index of a graph / Ruini, Beatrice. - STAMPA. - (2008), pp. 287-287. (Intervento presentato al convegno Combinatorics 2008 tenutosi a Costermano (VR) Italy nel 22/06/2008-28/06/2008).
On the automorphic chromatic index of a graph
RUINI, Beatrice
2008
Abstract
We define the automorphic H-chromatic index of a graph G as the minimum integer m for which G has a proper edge-coloring with m colors which is preserved by a given automorphism group H of G. After the description of some properties, we determine upper bounds for this index when H is a cyclic group of prime order. We also show that these upper bounds are best possible in a number of istances.
Pubblicazioni consigliate
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris
