On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two

DOI10.1016/j.disc.2010.12.013zbMath1222.05055OpenAlexW2030889781MaRDI QIDQ626859

R. Sritharan, Chính T. Hoàng, Elaine M. Eschen, Lorna K. Stewart

Publication date: 18 February 2011

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2010.12.013

zbMATH Keywords

complexitydistinguishing chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Upper bounds on the locating chromatic number of trees

Cites Work

• Unnamed Item
• Unnamed Item
• The distinguishing chromatic number
• On computing the distinguishing and distinguishing chromatic numbers of interval graphs and other results
• A note on the asymptotic and computational complexity of graph distinguishability
• Symmetry breaking in graphs
• On Computing the Distinguishing Numbers of Planar Graphs and Beyond: A Counting Approach
• On the Structure of Polynomial Time Reducibility

This page was built for publication: On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two