graph coloring

(redirected from Vertex-colouring)

graph coloring

References in periodicals archive ?
Vertex-colouring edge-weightings with two edge weights.
Vertex-colouring edgeweightings with two edge weights.
This notably implies the NP-completeness of several problems asking whether G is an extremal graph (in terms of needed colours) for some vertex-colouring problems.
In particular, as side results we get that deciding whether an undirected graph is extremal (in terms of needed colours) for some vertex-colouring problems is NP-complete.
It is worth mentioning that Theorem 5 has consequences on some special vertex-colouring problems.
an oriented clique if it does not admit an oriented vertex-colouring using strictly less than |V([?
2 Proper vertex-colouring of 2 -edge-coloured graphs
Each weighting gives a vertex-colouring for its respective case.
Thus there is a choice for each path which gives an edge-weighting vertex-colouring.
1] is coloured with x while the colour classes of the proper vertex-colouring containing [v.