Equitable Colourings of d-degenerate Graphs

DOI10.1017/S0963548302005485zbMath1012.05063MaRDI QIDQ4796725

Kittikorn Nakprasit, Alexandr V. Kostochka

Publication date: 13 June 2003

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

zbMATH Keywords

\(d\)-degenerate graphequitable colouring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (14)

Equitable chromatic number of weak modular product of Some graphs ⋮ Equitable coloring and equitable choosability of graphs with small maximum average degree ⋮ Equitable colorings of Kronecker products of graphs ⋮ Equitable and equitable list colorings of graphs ⋮ Equitable and list equitable colorings of planar graphs without 4-cycles ⋮ Equitable vertex arboricity conjecture holds for graphs with low degeneracy ⋮ Equitable list colorings of planar graphs without short cycles ⋮ Equitable coloring of three classes of 1-planar graphs ⋮ On equitable and equitable list colorings of series-parallel graphs ⋮ On equitable colorings of sparse graphs ⋮ Equitable defective coloring of sparse planar graphs ⋮ Equitable colorings of Cartesian products of graphs ⋮ Fast algorithm of equitably partitioning degenerate graphs into graphs with lower degeneracy ⋮ On equitable \(\Delta\)-coloring of graphs with low average degree

This page was built for publication: Equitable Colourings of d-degenerate Graphs