On Equitable Coloring of d-Degenerate Graphs

DOI10.1137/S0895480103436505zbMath1082.05037OpenAlexW2080846906MaRDI QIDQ5317598

Kittikorn Nakprasit, Alexandr V. Kostochka, Sriram V. Pemmaraju

Publication date: 16 September 2005

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895480103436505

zbMATH Keywords

graph coloring

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Equitable colorings of Kronecker products of graphs ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Packing \(d\)-degenerate graphs ⋮ Equitable coloring planar graphs with large girth ⋮ Equitable partition of planar graphs ⋮ Monadic Second Order Logic on Graphs with Local Cardinality Constraints ⋮ Equitable coloring of random graphs ⋮ On equitable colorings of sparse graphs ⋮ Tree-coloring problems of bounded treewidth graphs ⋮ Equitable colorings of Cartesian products of graphs ⋮ Fast algorithm of equitably partitioning degenerate graphs into graphs with lower degeneracy ⋮ An Extension of the Blow-up Lemma to Arrangeable Graphs ⋮ Equitable partition of graphs into induced forests ⋮ Equitable colorings of bounded treewidth graphs