Given a graph G, an automorphic edge(vertex)-coloring of G is a proper edge(vertex)-coloring such that each automorphism of the graph preserves the coloring. The automorphic chromatic index (number) is the least integer k for which G admits an automorphic edge(vertex)-coloring with k colors. We show that it is NP-complete to determine the automorphic chromatic index and the automorphic chromatic number of an arbitrary graph.
The NP-completeness of automorphic colorings / Mazzuoccolo, Giuseppe. - In: DISCUSSIONES MATHEMATICAE. GRAPH THEORY. - ISSN 1234-3099. - STAMPA. - 30:(2010), pp. 705-710. [10.7151/dmgt.1525]
The NP-completeness of automorphic colorings
MAZZUOCCOLO, Giuseppe
2010
Abstract
Given a graph G, an automorphic edge(vertex)-coloring of G is a proper edge(vertex)-coloring such that each automorphism of the graph preserves the coloring. The automorphic chromatic index (number) is the least integer k for which G admits an automorphic edge(vertex)-coloring with k colors. We show that it is NP-complete to determine the automorphic chromatic index and the automorphic chromatic number of an arbitrary graph.
| File | Dimensione | Formato | |
|---|---|---|---|
|
DMGT-1525.pdf
Open access
Tipologia:
Versione pubblicata dall'editore
Dimensione
90.83 kB
Formato
Adobe PDF
|
90.83 kB | Adobe PDF | Visualizza/Apri |
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
