graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called "colors" to elements of a graph subject...

as is required in the graph coloring problem. In contrast, such a coloring is impossible in the case of a non-bipartite graph, such as a triangle: after...

In graph theory, a proper edge coloring of a graph is an assignment of "colors" to the edges of the graph so that no two incident edges have the same color...

registers representing available colors) would be a coloring for the original graph. As Graph Coloring is an NP-Hard problem and Register Allocation is in...

edge-coloring is a type of graph coloring that combines list coloring and edge coloring. An instance of a list edge-coloring problem consists of a graph together...

of a graph is the maximum number of colors in a complete coloring. acyclic 1.  A graph is acyclic if it has no cycles. An undirected acyclic graph is the...

colorings and cliques in those families. For instance, in all perfect graphs, the graph coloring problem, maximum clique problem, and maximum independent set problem...

automorphism Graph coloring Graph database Graph data structure Graph drawing Graph equation Graph rewriting Graph sandwich problem Graph property Intersection...

Goldberg–Seymour conjecture Graph coloring game Graph two-coloring Harmonious coloring Incidence coloring List coloring List edge-coloring Perfect graph Ramsey's theorem...

In graph theory, a branch of mathematics, list coloring is a type of graph coloring where each vertex can be restricted to a list of allowed colors. It...