New methods to color the vertices of a graph

  title={New methods to color the vertices of a graph},
  author={Daniel Br{\'e}laz},
  journal={Commun. ACM},
  • Daniel Brélaz
  • Published 1979
  • Computer Science
  • Commun. ACM
  • This paper describes efficient new heuristic methods to color the vertices of a graph which rely upon the comparison of the degrees and structure of a graph. A method is developed which is exact for bipartite graphs and is an important part of heuristic procedures to find maximal cliques in general graphs. Finally an exact method is given which performs better than the Randall-Brown algorithm and is able to color larger graphs, and the new heuristic methods, the classical methods, and the exact… CONTINUE READING
    Hybrid Evolutionary Algorithms for Graph Coloring
    • 461
    • PDF
    On the use of some known methods forT-colorings of graphs
    • D. Costa
    • Mathematics, Computer Science
    • 1993
    • 72
    An exact method for graph coloring
    • 34
    • PDF
    A local search heuristic for chromatic sum
    • 22
    • PDF
    A New Ant Algorithm for Graph Coloring
    • 18
    • Highly Influenced
    • PDF
    An ant-based algorithm for coloring graphs
    • 74
    • PDF
    An algorithm for finding a maximum clique in a graph
    • D. Wood
    • Mathematics, Computer Science
    • 1997
    • 125
    On the recursive largest first algorithm for graph colouring
    • 16