Pages that link to "Item:Q1953399"
From MaRDI portal
The following pages link to Graphs with large distinguishing chromatic number (Q1953399):
Displaying 12 items.
- Nordhaus-Gaddum theorem for the distinguishing chromatic number (Q396886) (← links)
- Distinguishing chromatic numbers of complements of Cartesian products of complete graphs (Q724854) (← links)
- The distinguishing chromatic number (Q815210) (← links)
- Distinguishing and distinguishing chromatic numbers of generalized Petersen graphs (Q1011889) (← links)
- Proper distinguishing colorings with few colors for graphs with girth at least 5 (Q1658779) (← links)
- Upper bounds on the locating chromatic number of trees (Q1730257) (← links)
- Trees with distinguishing index equal distinguishing number plus one (Q2175243) (← links)
- Distinguishing chromatic numbers of bipartite graphs (Q2380231) (← links)
- Distinguishing partitions of complete multipartite graphs (Q2810380) (← links)
- (Q3804716) (← links)
- Subgraphs with a large cochromatic number (Q4351317) (← links)
- On the comparison of the distinguishing coloring and the locating coloring of graphs (Q6095325) (← links)