scientific article; zbMATH DE number 3800939
From MaRDI portal
Publication:4745272
zbMath0507.68038MaRDI QIDQ4745272
Stephen T. Hedetniemi, Terry Beyer, Sandra M. Hedetniemi
Publication date: 1982
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)
Related Items (22)
On the Nash number and the diminishing Grundy number of a graph ⋮ Dynamic \(F\)-free coloring of graphs ⋮ New Bounds on the Grundy Number of Products of Graphs ⋮ Results on the Grundy chromatic number of graphs ⋮ Recoloring graphs via tree decompositions ⋮ Transitivity on subclasses of chordal graphs ⋮ A new vertex coloring heuristic and corresponding chromatic number ⋮ Computational aspects of greedy partitioning of graphs ⋮ Grundy coloring in some subclasses of bipartite graphs and their complements ⋮ On the equality of the partial Grundy and upper ochromatic numbers of graphs ⋮ Grundy Coloring and friends, half-graphs, bicliques ⋮ Iterated colorings of graphs. ⋮ On Computational Aspects of Greedy Partitioning of Graphs ⋮ Minimum order of graphs with given coloring parameters ⋮ A survey on the Intersection graphs of ideals of rings ⋮ Complexity of Grundy coloring and its variants ⋮ On the Grundy number of graphs with few \(P_4\)'s ⋮ Grundy number and products of graphs ⋮ Grundy number on -classes ⋮ An algorithm for partial Grundy number on trees ⋮ Transitivity on subclasses of bipartite graphs ⋮ Grundy coloring for power graphs
This page was built for publication:
