Upper bounds for the chromatic number of a graph

DOI10.1016/j.endm.2006.06.076zbMath1134.05315OpenAlexW2064641527MaRDI QIDQ3439493

Ingo Schiermeyer

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

zbMATH Keywords

chromatic numbervertex colouring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (2)

\([r,s,t\)-coloring of trees and bipartite graphs] ⋮ Upper bounds for the chromatic number of a graph

Cites Work

• Upper bounds for the chromatic number of a graph
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Upper bounds for the chromatic number of a graph