Hostname: page-component-586b7cd67f-t8hqh Total loading time: 0 Render date: 2024-11-27T14:29:53.507Z Has data issue: false hasContentIssue false
  • English
  • Français

Equitable Colourings of d-degenerate Graphs

Published online by Cambridge University Press:  28 January 2003

A. V. KOSTOCHKA  and
K. NAKPRASIT
A. V. KOSTOCHKA
Affiliation:
University of Illinois, Urbana, IL 61801, USA Institute of Mathematics, Novosibirsk, Russia 630090
K. NAKPRASIT
Affiliation:
Institute of Mathematics, Novosibirsk, Russia 630090
Get access Rights & Permissions [Opens in a new window]

Abstract

A proper vertex coloring of a graph is called equitable if the sizes of colour classes differ by at most 1. In this paper, we find the minimum number l=l(d, Δ) such that every d-degenerate graph with maximum degree at most Δ admits an equitable t-colouring for every t[ges ]l when Δ[ges ]27d.

Type
Research Article
Information
Combinatorics, Probability and Computing , Volume 12 , Issue 1 , January 2003 , pp. 53 - 60
Copyright
2003 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)