In this paper we define the automorphic H-chromatic index of agraph G as the minimum integer m for which G has aproper 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 indexwhen 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 / Fiori, Carla; Mazzuoccolo, Giuseppe; Ruini, Beatrice. - In: GRAPHS AND COMBINATORICS. - ISSN 0911-0119. - ELETTRONICO. - 26:5(2010), pp. 685-694. [10.1007/s00373-010-0923-z]
On the automorphic chromatic index of a graph
FIORI, Carla;MAZZUOCCOLO, Giuseppe;RUINI, Beatrice
2010
Abstract
In this paper we define the automorphic H-chromatic index of agraph G as the minimum integer m for which G has aproper 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 indexwhen H is a cyclic group of prime order. We also show that these upper bounds are best possible in a number of istances.File | Dimensione | Formato | |
---|---|---|---|
VQRautom_chrom_indexI.pdf
Accesso riservato
Tipologia:
AO - Versione originale dell'autore proposta per la pubblicazione
Dimensione
204.38 kB
Formato
Adobe PDF
|
204.38 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
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