Bounds for the chromatic number of a graph
From MaRDI portal
Publication:5572941
DOI10.1016/S0021-9800(69)80010-4zbMath0182.57802MaRDI QIDQ5572941
Publication date: 1969
Published in: Journal of Combinatorial Theory (Search for Journal in Brave)
Related Items (8)
Unnamed Item ⋮ Inequalities for the chromatic numbers of graphs ⋮ Graphs isomorphisms under edge-replacements and the family of amoebas ⋮ Approximating the chromatic polynomial of a graph ⋮ Graph theory ⋮ A sequential coloring algorithm for finite sets ⋮ Lower bounds for the clique and the chromatic numbers of a graph ⋮ Inequalities involving the irredundance number of a graph
This page was built for publication: Bounds for the chromatic number of a graph
