The list Distinguishing Number Equals the Distinguishing Number for Interval Graphs
A distinguishing coloring of a graph G is a coloring of the vertices so that every nontrivial automorphism of G maps some vertex to a vertex with a different color. The distinguishing number of G is the minimum k such that G has a distinguishing coloring where each vertex is assigned a color from {1...
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Artigo |
| Lingua: | Inglês |
| Pubblicazione: |
University of Zielona Góra
2017-02-01
|
| Serie: | Discussiones Mathematicae Graph Theory |
| Soggetti: | |
| Accesso online: | https://doi.org/10.7151/dmgt.1927 |
| Tags: |
Nessun Tag, puoi essere il primo ad aggiungerne!!
|