The list distinguishing number equals the distinguishing number for interval graphs
Work
Year: 2016
Type: article
Abstract: 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 th... more
Authors Poppy Immel, Paul S. Wenger
Institution Rochester Institute of Technology
Cites: 19
Cited by: 7
Related to: 10
FWCI: 1.357
Citation percentile (by year/subfield): 71.36
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond