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 1 April 1979
  • Computer Science, Mathematics
  • 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… 
Some sequential graph colouring algorithms
We describe a heuristic algorithm to colour the vertices of a graph which relies upon the comparison of the degrees and structure of the graph. We have compared it with the maximum-degree-node-first
Coloring Programs in Graph Theory
Purpose of this paper to introduce the two new heuristic graph coloring programs which are based on known heuristic algorithms, have already been introduced. First one is adaptation of the Largest
An Analysis of Heuristics for Vertex Colouring
A new set of random graphs controlling their structural features and advance the knowledge of heuristics for graph colouring is generated to facilitate future comparisons.
A New Ant Algorithm for Graph Coloring
A new ant algorithm for the k-coloring problem is described, which is competitive with the existing ant algorithms for this problem, while giving a minor role to each ant.
An exact method for graph coloring
These algorithms are the first to the knowledge to solve the COLOR02 instance 4-Inser_3 with an exact method and are useful to solve more quickly than other exact algorithms instances with small linearwidth, such as mug graphs.
A local search heuristic for chromatic sum
A coloring of an undirected graph is a labelling of the vertices in the graph such that no two adjacent vertices receive the same label. The sum coloring problem asks to find a coloring, using
A Survey on Heuristic Graph Coloring Algorithm
The problem of graph coloring is to assign color to all the vertices such that no neighbor vertices have same color. This is known as vertex coloring. Graph coloring problem belongs to the class of
Recent Advances in Graph Vertex Coloring
This chapter surveys and analyzes graph coloring heuristics with a focus on the most recent advances and results obtained recently, notably for coloring large and very large graphs.
Numerical experiences with graph coloring algorithms
Abstract We consider the problem to color the vertices of a graph with a minimal number of colors. Sequential vertex (Sv) algorithms are mostly used for approximate solutions. For the selection of
Graph Coloring with Minimum Colors
In this paper we introduce an approach for solving the graph coloring problem. The problem is a NP-complete problem and the complexities of almost all the available algorithms are very high. On the


Chromatic Scheduling and the Chromatic Number Problem
The chromatic scheduling problem may be defined as any problem in which the solution is a partition of a set of objects. Since the partitions may not be distinct, redundant solutions can be generated
Compactness and balancing in scheduling
Some graph-theoretical models for scheduling problems are considered, showing how 2 types of requirements which arise in real life situation can be taken into account in some graph coloring models.
Large-scale linear programming using the Cholesky factorization.
A variation of the revised simplex method is proposed for solving the standard linear programming problem. The method is derived from an algorithm recently proposed by Gill and Murray, and is based
Greedy algorithms for optimization problems. Presented at Euro I meeting
  • Greedy algorithms for optimization problems. Presented at Euro I meeting
  • 1975
Un algorithme de coloration. Cabiers du centre d'~tudes de
  • Recherche Op~rationnelle
  • 1975
Graphs and hypergraphs
This chapter describes the concept of sequential colorings is formalized and certain upper bounds on the minimum number of colors needed to color a graph, the chromatic number x(G), and shows that the recursive-smallest-vertex-degree-last-ordering-with-interchange coloring algorithm will color any planar graph in five or fewer colors.
Reducibility Among Combinatorial Problems
  • R. Karp
  • Computer Science
    Complexity of Computer Computations
  • 1972