Pełnotekstowe zasoby PLDML oraz innych baz dziedzinowych są już dostępne w nowej Bibliotece Nauki.
Zapraszamy na https://bibliotekanauki.pl

PL EN

Preferencje
Język
Widoczny [Schowaj] Abstrakt
Liczba wyników
• # Artykuł - szczegóły

## Discussiones Mathematicae Graph Theory

2017 | 37 | 1 | 165-174

## The list Distinguishing Number Equals the Distinguishing Number for Interval Graphs

EN

### Abstrakty

EN
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, . . . , k}. A list assignment to G is an assignment L = {L(v)}v∈V (G) of lists of colors to the vertices of G. A distinguishing L-coloring of G is a distinguishing coloring of G where the color of each vertex v comes from L(v). The list distinguishing number of G is the minimum k such that every list assignment to G in which |L(v)| = k for all v ∈ V (G) yields a distinguishing L-coloring of G. We prove that if G is an interval graph, then its distinguishing number and list distinguishing number are equal.

EN

165-174

wydano
2017-02-01
otrzymano
2015-09-15
poprawiono
2016-03-23
zaakceptowano
2016-03-23
online
2017-01-13

### Twórcy

autor
• School of Mathematical Sciences, Rochester Institute of Technology, Rochester, NY,
autor
• School of Mathematical Sciences, Rochester Institute of Technology, Rochester, NY,