On the complexity of deciding whether the distinguishing...

Discrete Mathematics 2011 Vol. 311; Iss. 6

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

Elaine M. Eschen, Chính T. Hoàng, R. Sritharan, Lorna Stewart
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
311
Year:
2011
Language:
english
Pages:
4
DOI:
10.1016/j.disc.2010.12.013
File:
PDF, 195 KB
english, 2011
Conversion to is in progress
Conversion to is failed