Pages that link to "Item:Q626859"

The following pages link to On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two (Q626859):

Displaying 1 item.

• Upper bounds on the locating chromatic number of trees (Q1730257) (← links)