scientific article; zbMATH DE number 2079370

MaRDI QIDQ4471329zbMATH OpenFDO

Authors Kittikorn Nakprasit, Sriram Pemmaraju, Alexandr Kostochka

Publication date 28 July 2004

Mathematics Subject Classification ID

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

Recommendations

• Equitable coloring of trees
• Mathematical Foundations of Computer Science 2004
• On Equitable Coloring of d-Degenerate Graphs
• A fast algorithm for equitable coloring
• scientific article; zbMATH DE number 1302199

Cited in

(8)

• Equitable critical graphs
• A note on \(r\)-equitable \(k\)-colorings of trees
• Equitable coloring planar graphs with large girth
• Equitable coloring of random graphs
• On equitable coloring of central graphs and total graphs
• Equitable block colourings.
• Equitable coloring of trees
• A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4471329)