scientific article; zbMATH DE number 3253789
From MaRDI portal
Publication:5540282
zbMath0157.55201MaRDI QIDQ5540282
Publication date: 1968
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Nordhaus-Gaddum theorem for the distinguishing chromatic number ⋮ Inequalities for the chromatic numbers of graphs ⋮ Extremal decompositions for Nordhaus-Gaddum theorems ⋮ Clique coverings and claw-free graphs ⋮ Split graphs and block representations ⋮ Unnamed Item ⋮ Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph ⋮ More bounds for the Grundy number of graphs ⋮ 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 and other bounds for the sum of squares of the positive eigenvalues of a graph ⋮ Graph colourings and partitions ⋮ The Nordhaus-Gaddum-type inequalities for the Zagreb index and co-index of graphs ⋮ Nordhaus-Gaddum relations for proximity and remoteness in graphs ⋮ Some relations between rank, chromatic number and energy of graphs ⋮ Nordhaus-Gaddum inequalities for the fractional and circular chromatic numbers ⋮ Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum ⋮ Extremal graphs in some coloring problems
