Rainbow matching in edge-colored graphs.
LeSaulnier, Timothy D.; Stocker, Christopher; Wenger, Paul S.; West, Douglas B. — 2010
The Electronic Journal of Combinatorics [electronic only]
Rainbow matching in edge-colored graphs.
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, . . . , 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...
Page 1