The following pages link to (Q5540282):
Displayed 14 items.
- Nordhaus-Gaddum theorem for the distinguishing chromatic number (Q396886) (← links)
- More bounds for the Grundy number of graphs (Q511707) (← links)
- The Nordhaus-Gaddum-type inequalities for the Zagreb index and co-index of graphs (Q712586) (← links)
- Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph (Q932184) (← links)
- Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number (Q955318) (← links)
- Variable neighborhood search for extremal graphs. 22. Extending bounds for independence to upper irredundance (Q967410) (← links)
- Nordhaus-Gaddum relations for proximity and remoteness in graphs (Q988253) (← links)
- Some relations between rank, chromatic number and energy of graphs (Q1011502) (← links)
- Nordhaus-Gaddum inequalities for the fractional and circular chromatic numbers (Q1025479) (← links)
- Inequalities for the chromatic numbers of graphs (Q1393405) (← links)
- Extremal graphs in some coloring problems (Q1584287) (← links)
- Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum (Q1827854) (← links)
- (Q3919748) (← links)
- Graph colourings and partitions (Q5941502) (← links)