On the First-Fit Chromatic Number of Graphs
From MaRDI portal
Publication:3393424
DOI10.1137/060672479zbMath1180.05042OpenAlexW2081990166MaRDI QIDQ3393424
Qi Liu, Gexin Yu, József Balogh, Stephen G. Hartke
Publication date: 20 August 2009
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/060672479
Cartesian productplanar graphrandom graphgreedy coloringfirst-fit chromatic numberGrundy coloringgrundy number
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (9)
New Bounds on the Grundy Number of Products of Graphs ⋮ First-fit colorings of graphs with no cycles of a prescribed even length ⋮ Bounds for the Grundy chromatic number of graphs in terms of domination number ⋮ First-fit chromatic numbers of \(d\)-degenerate graphs ⋮ On the family of \(r\)-regular graphs with Grundy number \(r+1\) ⋮ Complete colorings of planar graphs ⋮ Time complexity analysis of randomized search heuristics for the dynamic graph coloring problem ⋮ Grundy number and products of graphs ⋮ A note on the Grundy number and graph products
This page was built for publication: On the First-Fit Chromatic Number of Graphs
