On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two (Q626859)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two |
scientific article; zbMATH DE number 5853457
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two |
scientific article; zbMATH DE number 5853457 |
Statements
On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two (English)
0 references
18 February 2011
0 references
distinguishing chromatic number
0 references
complexity
0 references
0 references
0 references
