Brelaz, Daniel New methods to color the vertices of a graph. (English) Zbl 0394.05022 Commun. ACM 22, 251-256 (1979). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 1 ReviewCited in 189 Documents MSC: 05C15 Coloring of graphs and hypergraphs 05-04 Software, source code, etc. for problems pertaining to combinatorics Keywords:Balancing; Find Maximal Cliques in General Graphs; Graph Coloring; Bipartite Graphs; Scheduling; Randall-Brown Algorithm; Comparison Of Methods; Vertex Coloring; Np Complete; Graph Structure PDF BibTeX XML Cite \textit{D. Brelaz}, Commun. ACM 22, 251--256 (1979; Zbl 0394.05022) Full Text: DOI OpenURL