Reexploring the upper bound for the chromatic number of graphs

DOI10.1080/10020070412331343461zbMath1079.05506OpenAlexW2078662261MaRDI QIDQ2583338

Shuchao Li, Jingzhong Mao

Publication date: 16 January 2006

Published in: Progress in Natural Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10020070412331343461

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

This page was built for publication: Reexploring the upper bound for the chromatic number of graphs