# graph coloring

(redirected from Vertex coloring)

## graph coloring

Mentioned in ?
References in periodicals archive ?
The final chapter states linear programming models for the set partitioning problem, the vertex coloring problem, and the multiple traveling salesman problem.
Vertex coloring 2-edge weighting of bipartite graphs.
This is possible since every vertex coloring [phi]: V [right arrow] [c], where [c] = {1,2, .
While the game has now been examined extensively [4, 10, 12, 13, 14, 16, 17], and gone through numerous generalizations and variations [2, 3, 5, 6, 7, 8, 9, 15], we now present the standard version of the original vertex coloring game.
In a given graph G = (V, E), a set of vertices S with an assignment of colors to them is said to be a defining set of the vertex coloring of G if there exists a unique extension of the colors of S to a c [greater than or equal to] x(G) coloring of the vertices of G.
Two types of coloring namely vertex coloring and edge coloring are usually associated with any graph.
A legal vertex coloring of a graph G(V, E) is an assignment of colors to its vertices such that no two adjacent vertices receive the same color.
For a given graph G with a (0, 1)-additive labeling l the function [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] is a proper vertex coloring, so we have the following trivial lower bound for [[sigma].
Question: Is there a proper vertex coloring using at most r colors, with the property that the sizes of any two color classes (sets of vertices with the same color) differ by at most one?
On the other hand, traditional vertex coloring of (unweighted) graphs can be viewed as a circular one--consider the colors to lie in an appropriate ring of integer residues.
The vertex coloring is independent of the existence of edges.
Maximizing the number of unused colors in the vertex coloring problem.

Site: Follow: Share:
Open / Close