Sequential coloring versus Welsh-Powell bound

DOI10.1016/0012-365X(89)90212-4zbMath0674.05028MaRDI QIDQ1121275

Maciej M. Sysło

Publication date: 1989

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

zbMATH Keywords

chromatic numbersequential coloring algorithmWelsh-Powell upper bound

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (1)

The smallest hard-to-color graph

Cites Work

• An upper bound for the chromatic number of a graph and its application to timetabling problems
• Unnamed Item
• Unnamed Item

This page was built for publication: Sequential coloring versus Welsh-Powell bound