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...
保存先:
| 主要な著者: | , |
|---|---|
| フォーマット: | Artigo |
| 言語: | Inglês |
| 出版事項: |
University of Zielona Góra
2017-02-01
|
| シリーズ: | Discussiones Mathematicae Graph Theory |
| 主題: | |
| オンライン･アクセス: | https://doi.org/10.7151/dmgt.1927 |
| タグ: |
タグなし, このレコードへの初めてのタグを付けませんか!
|