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...
שמור ב:
| Principais autores: | , |
|---|---|
| פורמט: | Artigo |
| שפה: | Inglês |
| יצא לאור: |
University of Zielona Góra
2017-02-01
|
| סדרה: | Discussiones Mathematicae Graph Theory |
| נושאים: | |
| גישה מקוונת: | https://doi.org/10.7151/dmgt.1927 |
| תגים: |
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!
|