The List Distinguishing Number Equals the Distinguishing Number for Interval Graphs
Poppy Immel, Paul S. Wenger

TL;DR
This paper proves that for interval graphs, the minimum number of colors needed for a distinguishing coloring is the same whether colors are chosen freely or from lists, establishing an equality of these two parameters.
Contribution
The paper establishes that the distinguishing number and list distinguishing number are equal for all interval graphs, a significant result in graph symmetry and coloring theory.
Findings
Distinguishing number equals list distinguishing number for interval graphs
Provides a new insight into symmetry-breaking colorings in interval graphs
Enhances understanding of coloring constraints in graph automorphisms
Abstract
A \textit{distinguishing coloring} of a graph is a coloring of the vertices so that every nontrivial automorphism of maps some vertex to a vertex with a different color. The \textit{distinguishing number} of is the minimum such that has a distinguishing coloring where each vertex is assigned a color from . A \textit{list assignment} to is an assignment of lists of colors to the vertices of . A \textit{distinguishing -coloring} of is a distinguishing coloring of where the color of each vertex comes from . The {\it list distinguishing number} of is the minimum such that every list assignment to in which for all yields a distinguishing -coloring of . We prove that if is an interval graph, then its distinguishing number and list distinguishing number are…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Labeling and Dimension Problems · Advanced Graph Theory Research
