New tight upper bounds and equality characterizations for the distinguishing chromatic number of C4-free, chordal, 2K2-free, claw-free, and (claw,diamond)-free graphs.
Cranston, Proper Distinguishing Colorings with Few Colors for Graphs with Girth at Least 5.Electron
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
On the distinguishing chromatic number in hereditary graph classes
New tight upper bounds and equality characterizations for the distinguishing chromatic number of C4-free, chordal, 2K2-free, claw-free, and (claw,diamond)-free graphs.