Fractional coloring

Known as: Fractional graph coloring, Fractional chromatic number, Fractional colorings 
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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1994-2018
051019942018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
We prove that every planar triangle-free graph on n vertices has fractional chromatic number at most 3− 1 n+1/3 . 
Is this relevant?
2011
2011
We show that every (sub)cubic n-vertex graph with sufficiently large girth has fractional chromatic number at most 2.2978 which… (More)
Is this relevant?
2009
2009
PAC-Bayes bounds are among the most accurate generalization bounds for classifiers learned with IID data, and it is particularly… (More)
  • figure 1
Is this relevant?
2008
2008
Gerards and Seymour (see [T.R. Jensen, B. Toft, Graph Coloring Problems, Wiley-Interscience, 1995], page 115) conjectured that if… (More)
Is this relevant?
2005
2005
Let D be a set of positive integers. The distance graph G(Z , D) with distance set D is the graph with vertex set Z in which two… (More)
Is this relevant?
2003
2003
Motivated by the problem of allocating optical bandwidth in tree–shaped WDM networks, we study the fractional path coloring… (More)
Is this relevant?
1999
1999
We discuss relationships among T-colorings of graphs and chromatic numbers, fractional chromatic numbers, and circular chromatic… (More)
Is this relevant?
1998
1998
Unit disk graphs are the intersection graphs of equal sized circles in the plane. In this paper, we consider the maximum… (More)
Is this relevant?
Highly Cited
1996
Highly Cited
1996
The linear programming relaxation of the minimum vertex coloring problem, called the fractional coloring problem, is NP-hard. We… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Is this relevant?
1995
1995
The m-chromatic number ,ym(G) of a graph G is the fewest colors needed so each node has m colors and no color appears on adjacent… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?