Upper bounds for the chromatic number of a graph
From MaRDI portal
Publication:3439493
DOI10.1016/j.endm.2006.06.076zbMath1134.05315MaRDI QIDQ3439493
Publication date: 29 May 2007
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2006.06.076
05C15: Coloring of graphs and hypergraphs
Related Items
\([r,s,t\)-coloring of trees and bipartite graphs], Upper bounds for the chromatic number of a graph
Cites Work