The following pages link to The distinguishing chromatic number (Q815210):
Displaying 14 items.
- Coarse distinguishability of graphs with symmetric growth (Q5013344) (← links)
- The edge-distinguishing chromatic number of petal graphs, chorded cycles, and spider graphs (Q5054038) (← links)
- Distinguishing arc-colourings of symmetric digraphs (Q5058208) (← links)
- Number of colors needed to break symmetries of a graph by an arbitrary edge coloring (Q5058213) (← links)
- The distinguishing number and the distinguishing index of line and graphoidal graph(s) (Q5154552) (← links)
- The chromatic distinguishing index of certain graphs (Q5154569) (← links)
- Vertex transitive graphs G with χ_D(G) > χ(G) and small automorphism group (Q5217075) (← links)
- Distinguishing threshold of graphs (Q6074586) (← links)
- Distinguishing infinite graphs with bounded degrees (Q6081887) (← links)
- On the comparison of the distinguishing coloring and the locating coloring of graphs (Q6095325) (← links)
- (Q6166316) (← links)
- Edge-locating coloring of graphs (Q6571562) (← links)
- Transitive coloring of graphs (Q6573772) (← links)
- On the distinguishing chromatic number of the Kronecker products of graphs (Q6651161) (← links)
