First-fit chromatic numbers of \(d\)-degenerate graphs
From MaRDI portal
Publication:427876
DOI10.1016/j.disc.2012.03.029zbMath1243.05078MaRDI QIDQ427876
Gerard Jennhwa Chang, Hsiang-Chun Hsu
Publication date: 18 June 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2012.03.029
05C10: Planar graphs; geometric and topological aspects of graph theory
05C15: Coloring of graphs and hypergraphs
Related Items
More bounds for the Grundy number of graphs, Complexity of Grundy coloring and its variants, On the family of \(r\)-regular graphs with Grundy number \(r+1\)
Cites Work
- Unnamed Item
- Results on the Grundy chromatic number of graphs
- A note on the online first-fit algorithm for coloring \(k\)-inductive graphs
- Some perfect coloring properties of graphs
- Coloring inductive graphs on-line
- On the equality of the partial Grundy and upper ochromatic numbers of graphs
- Coloring interval graphs with First-Fit
- A market problem
- On the First-Fit Chromatic Number of Graphs
- Grundy coloring for power graphs
- On the equality of the grundy and ochromatic numbers of a graph
- Inequalities for the first-fit chromatic number
- The Linearity of First-Fit Coloring of Interval Graphs