Results on the Grundy chromatic number of graphs
DOI10.1016/J.DISC.2005.06.044zbMATH Open1105.05027OpenAlexW2038670407WikidataQ130405346 ScholiaQ130405346MaRDI QIDQ856867FDOQ856867
Authors: Manouchehr Zaker 
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
Recommendations
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)
Cites Work
- Some perfect coloring properties of graphs
- On-line 3-chromatic graphs. II: Critical graphs
- Title not available (Why is that?)
- Algorithms for Vertex Partitioning Problems on Partial k-Trees
- Recognizing Greedy Structures
- 25 pretty graph colouring problems
- Edge Dominating Sets in Graphs
- On-line and first fit colorings of graphs
- Inequalities for the first-fit chromatic number
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the equality of the grundy and ochromatic numbers of a graph
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (46)
- Transitivity on subclasses of bipartite graphs
- Algorithmic study of \(d_2\)-transitivity of graphs
- Grundy Distinguishes Treewidth from Pathwidth
- Grundy Coloring and friends, half-graphs, bicliques
- On the Grundy number of Cameron graphs
- Maximization coloring problems on graphs with few \(P_4\)
- Inequalities for the first-fit chromatic number
- A characterization of \(b\)-chromatic and partial Grundy numbers by induced subgraphs
- Title not available (Why is that?)
- Bounds for the Grundy chromatic number of graphs in terms of domination number
- A note on connected greedy edge colouring
- First-fit chromatic numbers of \(d\)-degenerate graphs
- On the Nash number and the diminishing Grundy number of a graph
- Geometric achromatic and pseudoachromatic indices
- Grundy number and products of graphs
- On the family of \(r\)-regular graphs with Grundy number \(r+1\)
- Dynamic \(F\)-free coloring of graphs
- Computational aspects of greedy partitioning of graphs
- Algorithmic study on 2-transitivity of graphs
- The digrundy number of digraphs
- On Computational Aspects of Greedy Partitioning of Graphs
- Title not available (Why is that?)
- First-fit colorings of graphs with no cycles of a prescribed even length
- On \(b\)-greedy colourings and \(z\)-colourings
- Well-hued graphs
- New bounds on the Grundy number of products of graphs
- Minimum order of graphs with given coloring parameters
- Spectral upper bounds for the Grundy number of a graph
- Recoloring graphs via tree decompositions
- Upper bounds for some graph invariants in terms of blocks and cut-vertices
- Grundy coloring in some subclasses of bipartite graphs and their complements
- On b-acyclic chromatic number of a graph
- A comparison of the Grundy and b-chromatic number of \(K_{2,t}\)-free graphs
- Hierarchical and modularly-minimal vertex colorings
- On the Grundy number of a graph
- More results on the \(z\)-chromatic number of graphs
- On the Grundy number of graphs with few \(P_4\)'s
- More bounds for the Grundy number of graphs
- A new vertex coloring heuristic and corresponding chromatic number
- Complexity of Grundy coloring and its variants
- Some comparative results concerning the Grundy and \(b\)-chromatic number of graphs
- On Grundy and b-chromatic number of some families of graphs: a comparative study
- On the Grundy and \(b\)-chromatic numbers of a graph
- Transitivity on subclasses of chordal graphs
- Inequalities for the Grundy chromatic number of graphs
- A note on Grundy colorings of central graphs
This page was built for publication: Results on the Grundy chromatic number of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q856867)
