Pages that link to "Item:Q396886"
From MaRDI portal
The following pages link to Nordhaus-Gaddum theorem for the distinguishing chromatic number (Q396886):
Displaying 9 items.
- Split graphs and Nordhaus-Gaddum graphs (Q297938) (← links)
- Distinguishing graphs by edge-colourings (Q482130) (← links)
- Distinguishing chromatic numbers of complements of Cartesian products of complete graphs (Q724854) (← links)
- Nordhaus-Gaddum and other bounds for the chromatic edge-stability number (Q2011157) (← links)
- On asymmetric colourings of claw-free graphs (Q2048557) (← links)
- Nordhaus-Gaddum type inequalities for the distinguishing index (Q3390050) (← links)
- Improving upper bounds for the distinguishing index (Q4604514) (← links)
- Extremal decompositions for Nordhaus-Gaddum theorems (Q6046167) (← links)
- Split graphs and block representations (Q6197725) (← links)
