Fractional coloring is a topic in a young branch of graph theory known as fractional graph theory. It is a generalization of ordinary graph coloring. In...

colors in any graph coloring. Thus, like the simpler Moser spindle, it provides a lower bound for the Hadwiger–Nelson problem: coloring the points of the...

In 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...

the fractional chromatic number of the total graph of a graph G is at most Δ(G) + 2. Hind, Hugh; Molloy, Michael; Reed, Bruce (1998). "Total coloring with...

graph Acyclic coloring Chromatic polynomial Cocoloring Complete coloring Edge coloring Exact coloring Four color theorem Fractional coloring Goldberg–Seymour...

In graph theory, a fractional matching is a generalization of a matching in which, intuitively, each vertex may be broken into fractions that are matched...

edge coloring of a graph by the colors red, blue, and green. Edge colorings are one of several different types of graph coloring. The edge-coloring problem...

branches on one of the remaining fractional variables. Fractional coloring, a linear programming relaxation of graph coloring. Randomized rounding, for obtaining...

"Approximation Algorithms for Maximum Independent Set Problems and Fractional Coloring Problems on Unit Disk Graphs", Discrete and Computational Geometry...

constructed it to be the smallest bridgeless cubic graph with no three-edge-coloring. Although the graph is generally credited to Petersen, it had in fact first...