Equitable colourings of d-degenerate graphs

A. V. Kostochka, K. Nakprasit

Research output: Contribution to journalArticlepeer-review


The proper vertex colorings of a graph, called as equitable colorings were discussed. The minimum number l was found, such that every d-degenerate graph with maximum degree at most δ admits an equitable coloring for every t ≥ l when δ ≥ 27d. The upper bounds on eq(G) for d-degenerate graphs with the given maximum degree were also found.

Original languageEnglish (US)
Pages (from-to)53-60
Number of pages8
JournalCombinatorics Probability and Computing
Issue number1
StatePublished - Jan 2003

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Statistics and Probability
  • Computational Theory and Mathematics
  • Applied Mathematics


Dive into the research topics of 'Equitable colourings of d-degenerate graphs'. Together they form a unique fingerprint.

Cite this