scientific article; zbMATH DE number 3253789
From MaRDI portal
Publication:5540282
Cited in
(20)- Some relations between rank, chromatic number and energy of graphs
- Nordhaus-Gaddum inequalities for the fractional and circular chromatic numbers
- Inequalities for the chromatic numbers of graphs
- Extremal graphs in some coloring problems
- Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum
- Nordhaus-Gaddum and other bounds for the sum of squares of the positive eigenvalues of a graph
- Clique coverings and claw-free graphs
- scientific article; zbMATH DE number 3732102 (Why is no real title available?)
- Nordhaus-Gaddum theorem for the distinguishing chromatic number
- More bounds for the Grundy number of graphs
- Graph colourings and partitions
- Extremal decompositions for Nordhaus-Gaddum theorems
- Split graphs and block representations
- Nordhaus-Gaddum theorems for multifactor decompositions
- Hereditary Nordhaus-Gaddum graphs
- The Nordhaus-Gaddum-type inequalities for the Zagreb index and co-index of graphs
- Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph
- Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number
- Variable neighborhood search for extremal graphs. 22. Extending bounds for independence to upper irredundance
- Nordhaus-Gaddum relations for proximity and remoteness in graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5540282)
