Results on the Grundy chromatic number of graphs
From MaRDI portal
Publication:856867
DOI10.1016/j.disc.2005.06.044zbMath1105.05027OpenAlexW2038670407MaRDI QIDQ856867
Publication date: 14 December 2006
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2005.06.044
coloringNP-complete problemNordhaus-Gaddum-type inequalitiescoNP-complete problempolynomial time problem
Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (37)
On the Nash number and the diminishing Grundy number of a graph ⋮ A characterization of \(b\)-chromatic and partial Grundy numbers by induced subgraphs ⋮ Geometric achromatic and pseudoachromatic indices ⋮ Dynamic \(F\)-free coloring of graphs ⋮ Hierarchical and modularly-minimal vertex colorings ⋮ New Bounds on the Grundy Number of Products of Graphs ⋮ First-fit colorings of graphs with no cycles of a prescribed even length ⋮ Well-hued graphs ⋮ On Grundy and b-chromatic number of some families of graphs: a comparative study ⋮ On the Grundy number of Cameron graphs ⋮ Grundy Distinguishes Treewidth from Pathwidth ⋮ Recoloring graphs via tree decompositions ⋮ Bounds for the Grundy chromatic number of graphs in terms of domination number ⋮ More results on the \(z\)-chromatic number of graphs ⋮ Transitivity on subclasses of chordal graphs ⋮ On b-acyclic chromatic number of a graph ⋮ A new vertex coloring heuristic and corresponding chromatic number ⋮ Unnamed Item ⋮ A comparison of the Grundy and b-chromatic number of \(K_{2,t}\)-free graphs ⋮ First-fit chromatic numbers of \(d\)-degenerate graphs ⋮ Computational aspects of greedy partitioning of graphs ⋮ Grundy coloring in some subclasses of bipartite graphs and their complements ⋮ On the Grundy and \(b\)-chromatic numbers of a graph ⋮ Grundy Coloring and friends, half-graphs, bicliques ⋮ Inequalities for the first-fit chromatic number ⋮ Maximization coloring problems on graphs with few \(P_4\) ⋮ On the family of \(r\)-regular graphs with Grundy number \(r+1\) ⋮ On Computational Aspects of Greedy Partitioning of Graphs ⋮ A note on connected greedy edge colouring ⋮ Inequalities for the Grundy chromatic number of graphs ⋮ Some comparative results concerning the Grundy and \(b\)-chromatic number of graphs ⋮ More bounds for the Grundy number of graphs ⋮ Complexity of Grundy coloring and its variants ⋮ On the Grundy number of graphs with few \(P_4\)'s ⋮ Grundy number and products of graphs ⋮ On the Grundy Number of a Graph ⋮ Transitivity on subclasses of bipartite graphs
Cites Work
- Some perfect coloring properties of graphs
- On-line 3-chromatic graphs. II: Critical graphs
- On the equality of the grundy and ochromatic numbers of a graph
- Inequalities for the first-fit chromatic number
- On-line and first fit colorings of graphs
- Edge Dominating Sets in Graphs
- Algorithms for Vertex Partitioning Problems on Partial k-Trees
- Recognizing Greedy Structures
- 25 pretty graph colouring problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Results on the Grundy chromatic number of graphs
