scientific article; zbMATH DE number 3800939

MaRDI QIDQ4745272zbMATH OpenFDO

Authors Sandra M. Hedetniemi, Stephen T. Hedetniemi, Terry Beyer

Publication date 1982

zbMATH Keywords

achromatic numberchromatic number

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cited in

(34)

• On the equality of the partial Grundy and upper ochromatic numbers of graphs
• Iterated colorings of graphs.
• Dynamic \(F\)-free coloring of graphs
• Recoloring graphs via tree decompositions
• Computational aspects of greedy partitioning of graphs
• On the Grundy number of graphs with few P₄'s
• Transitivity on subclasses of bipartite graphs
• On the Nash number and the diminishing Grundy number of a graph
• A new vertex coloring heuristic and corresponding chromatic number
• Grundy coloring in some subclasses of bipartite graphs and their complements
• An algorithm for partial Grundy number on trees
• Grundy Coloring and friends, half-graphs, bicliques
• Grundy number on P₄-classes
• New bounds on the Grundy number of products of graphs
• Grundy coloring for power 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
• Transitivity on subclasses of chordal graphs
• Results on Grundy chromatic number of join graph of graphs
• Algorithmic study of \(d_2\)-transitivity of graphs
• Algorithmic study on 2-transitivity of graphs
• On b-greedy colourings and z-colourings
• The connected Grundy coloring problem: formulations and a local-search enhanced biased random-key genetic algorithm
• On complementarily transitivity of graphs
• Tournament transitivity of graphs
• Transitivity in some graph-classes
• Strong transitivity of a graph
• Fast FPT algorithms for Grundy number on dense graphs
• \(\mathcal{O}(VE)\) time algorithms for the Grundy (first-fit) chromatic number of block graphs and graphs with large girth
• Parameterized saga of first-fit and last-fit coloring
• The achromatic number and the pseudoachromatic number of caterpillars
• Results on the Grundy chromatic number of graphs
• Grundy number and products of 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 Q4745272)