Fractional coloring

Known as: Fractional graph coloring, Fractional chromatic number, Chromatic (disambiguation)

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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2015

The main result of this work is that fractional coloring (orthogonal access) achieves the all-unicast capacity (degrees of…

2013

The Lovasz theta function and the associated convex sets known as theta bodies are fundamental objects in combinatorial and…

2013

This thesis investigates problems in a number of different areas of graph theory. These problems are related in the sense that…

2010

Given a weighted graph $G_\bx$, where $(x(v): v \in V)$ is a non-negative, real-valued weight assigned to the vertices of G, let…

2010

We consider a number of related results taken from two papers – one by W. Lin [1], and the other D. C. Fisher[2]. These articles…

2004

The relation between the girth and the fractional chromatic number of series-parallel graphs is discussed, and an upper bound of…

2003

Motivated by the problem of allocating optical bandwidth in tree–shaped WDM networks, we study the fractional path coloring…

1998

Edge Coloring is the following optimization problem: Given a graph, how many colors are required to color its edges in such a way…

1997

We may formulate the chromatic number of a graph as follows: choose as few independent sets as possible such that every vertex of…

1997

LetG=(V, E) be an undirected graph andc any vector in ℤV(G)+. Denote byχ(Gc) (resp.η(Gc)) the chromatic number (resp. fractional…