-
Algorithmic aspects of graph colourings heuristics
A proper colouring of a graph is a function that assigns a colour to each vertex with the restriction that adjacent vertices are assigned with distinct colours. Proper... -
Weighted Improper Colouring
In this paper, we study a colouring problem motivated by a practical frequency assignment problem and, up to our best knowledge, new. In wireless networks, a node... -
On the diameter of reconfiguration graphs for vertex colourings
International audience -
Reconfiguration graphs for vertex colourings of chordal and chordal bipartite...
International audience -
On the proper orientation number of bipartite graphs
An {\it orientation} of a graph~$G$ is a digraph~$D$ obtained from~$G$ by replacing each edge by exactly one of the two possible arcs with the same endvertices. For... -
Acyclic, Star and Oriented Colourings of Graph Subdivisions
International audience -
Vertex-colouring edge-weightings with two edge weights
Graphs and Algorithms
