Circular coloring

In graph theory, circular coloring may be viewed as a refinement of usual graph coloring. The circular chromatic number of a graph , denoted can be…

Papers overview

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

2015

Let k,d ( 2d≤k) be two positive integers. We generalize the well‐studied notions of (k,d) ‐colorings and of the circular…

2015

A graph is called fractional ( r s , d ) -defective colorable if its vertices can be colored with r colors in such a way that…

Review

2014

Review

2014

Circular coloring is a popular branch of graph theory which has been exhaustively studied for two decades mainly from a…

2008

IN this paper, a new approach to formulate a class of scheduling problems is introduced, which can be applied to many other…

2007

The unit distance graph $\mathcal{R}$ is the graph with vertex set $\mathbb{R}^2$ in which two vertices (points in the plane) are…

2007

Suppose G=(V, E) is a graph and p ≥ 2q are positive integers. A (p, q)‐coloring of G is a mapping ϕ: V → {0, 1, …, p‐1} such that…

2005

2004

Let G = (V,E) be a simple un-weighted graph, and let → d= (d1, d2, · · ·, dm) be a sequence of positive reals. For a positive…

2002

The concept of a defective circular coloring is introduced, and results shown for planar, series-parallel, and outerplanar graphs…

1994

Suppose that G is a nite simple graph and w is a weight function which assigns to each vertex of G a nonnegative real number. Let…