Pages that link to "Item:Q2380243"

The following pages link to Bounds on the distinguishing chromatic number (Q2380243):

Displaying 9 items.

• Nordhaus-Gaddum theorem for the distinguishing chromatic number (Q396886) (← links)
• Distinguishing graphs by edge-colourings (Q482130) (← links)
• Distinguishing chromatic numbers of complements of Cartesian products of complete graphs (Q724854) (← links)
• Proper distinguishing colorings with few colors for graphs with girth at least 5 (Q1658779) (← links)
• Distinguishing chromatic number of random Cayley graphs (Q2012532) (← links)
• The distinguishing number and distinguishing chromatic number for posets (Q2088064) (← links)
• On the local distinguishing chromatic number (Q2293833) (← links)
• Improving upper bounds for the distinguishing index (Q4604514) (← links)
• Vertex transitive graphs G with χ_D(G) > χ(G) and small automorphism group (Q5217075) (← links)