Pages that link to "Item:Q2380231"
From MaRDI portal
The following pages link to Distinguishing chromatic numbers of bipartite graphs (Q2380231):
Displaying 6 items.
- Distinguishing chromatic numbers of complements of Cartesian products of complete graphs (Q724854) (← links)
- Number of distinguishing colorings and partitions (Q776312) (← 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)
- On the local distinguishing chromatic number (Q2293833) (← links)
- The distinguishing chromatic number of bipartite graphs of girth at least six (Q5122711) (← links)