Results on the Grundy chromatic number of graphs
From MaRDI portal
(Redirected from Publication:856867)
Recommendations
Cites work
- scientific article; zbMATH DE number 3851129 (Why is no real title available?)
- scientific article; zbMATH DE number 65699 (Why is no real title available?)
- scientific article; zbMATH DE number 1194938 (Why is no real title available?)
- scientific article; zbMATH DE number 1289750 (Why is no real title available?)
- scientific article; zbMATH DE number 2147949 (Why is no real title available?)
- scientific article; zbMATH DE number 3800939 (Why is no real title available?)
- 25 pretty graph colouring problems
- Algorithms for Vertex Partitioning Problems on Partial k-Trees
- Edge Dominating Sets in Graphs
- Inequalities for the first-fit chromatic number
- On the equality of the grundy and ochromatic numbers of a graph
- On-line 3-chromatic graphs. II: Critical graphs
- On-line and first fit colorings of graphs
- Recognizing Greedy Structures
- Some perfect coloring properties of graphs
Cited in
(45)- A note on Grundy colorings of central graphs
- Dynamic \(F\)-free coloring of graphs
- On Grundy and b-chromatic number of some families of graphs: a comparative study
- A note on connected greedy edge colouring
- Algorithmic study on 2-transitivity of graphs
- Inequalities for the first-fit chromatic number
- Geometric achromatic and pseudoachromatic indices
- Grundy number and products of graphs
- Grundy coloring in some subclasses of bipartite graphs and their complements
- Upper bounds for some graph invariants in terms of blocks and cut-vertices
- Grundy Coloring and friends, half-graphs, bicliques
- First-fit chromatic numbers of \(d\)-degenerate graphs
- A characterization of \(b\)-chromatic and partial Grundy numbers by induced subgraphs
- On b-acyclic chromatic number of a graph
- On the Grundy number of Cameron graphs
- A comparison of the Grundy and b-chromatic number of \(K_{2,t}\)-free graphs
- The digrundy number of digraphs
- On the Grundy number of a graph
- Spectral upper bounds for the Grundy number of a graph
- A new vertex coloring heuristic and corresponding chromatic number
- Recoloring graphs via tree decompositions
- Hierarchical and modularly-minimal vertex colorings
- New bounds on the Grundy number of products of graphs
- Computational aspects of greedy partitioning of graphs
- On the Grundy and \(b\)-chromatic numbers of a graph
- On the family of \(r\)-regular graphs with Grundy number \(r+1\)
- More results on the \(z\)-chromatic number of graphs
- On the Grundy number of graphs with few \(P_4\)'s
- Some comparative results concerning the Grundy and \(b\)-chromatic number of graphs
- On the Nash number and the diminishing Grundy number of a graph
- Transitivity on subclasses of bipartite graphs
- On Computational Aspects of Greedy Partitioning of Graphs
- First-fit colorings of graphs with no cycles of a prescribed even length
- Minimum order of graphs with given coloring parameters
- Transitivity on subclasses of chordal graphs
- scientific article; zbMATH DE number 2147949 (Why is no real title available?)
- More bounds for the Grundy number of graphs
- Grundy distinguishes treewidth from pathwidth
- On \(b\)-greedy colourings and \(z\)-colourings
- Algorithmic study of \(d_2\)-transitivity of graphs
- Bounds for the Grundy chromatic number of graphs in terms of domination number
- Well-hued graphs
- Grundy Distinguishes Treewidth from Pathwidth
- Maximization coloring problems on graphs with few \(P_4\)
- Inequalities for the Grundy chromatic number of 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)
