The automorphic H-chromatic index of a graph G is theminimum integer m for which G has a proper edge-coloringwith m colors preserved by a given subgroup H of the fullautomorphism group of G. We determine upper bounds for this indexin terms of the chromatic index of G for some abelian 2-groups H.
Upper bounds for the automorphic chromatic index of a graph
Mazzuoccolo, Giuseppe;
2014-01-01
Abstract
The automorphic H-chromatic index of a graph G is theminimum integer m for which G has a proper edge-coloringwith m colors preserved by a given subgroup H of the fullautomorphism group of G. We determine upper bounds for this indexin terms of the chromatic index of G for some abelian 2-groups H.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
