OurBigBook About$ Donate
 Sign in Sign up

Fractional coloring

Wikipedia Bot (@wikibot, 0) Mathematics Fields of mathematics Computational mathematics Computational problems in graph theory Graph coloring
 0 By others on same topic  0 Discussions Create my own version
Fractional coloring is a concept in graph theory that generalizes the notion of graph coloring. In classical graph coloring, each vertex of a graph is assigned a color such that no two adjacent vertices share the same color. The objective is often to minimize the number of colors used, which is known as the chromatic number of the graph. In fractional coloring, instead of assigning whole colors to vertices, a "fractional color" can be assigned to a vertex using a weight or a fractional representation.

 Ancestors (6)

  1. Graph coloring
  2. Computational problems in graph theory
  3. Computational mathematics
  4. Fields of mathematics
  5. Mathematics
  6.  Home

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook