Sciweavers

284 search results - page 2 / 57
» On the adaptable chromatic number of graphs
Sort
View
APPML
2011
13 years 2 days ago
The fractional chromatic number of Zykov products of graphs
Zykov designed one of the oldest known family of triangle-free graphs with arbitrarily high chromatic number. We determine the fractional chromatic number of the Zykov product of ...
Pierre Charbit, Jean-Sébastien Sereni
CORR
2010
Springer
168views Education» more  CORR 2010»
13 years 5 months ago
Upper oriented chromatic number of undirected graphs and oriented colorings of product graphs
The oriented chromatic number of an oriented graph G is the minimum order of an oriented graph H such that G admits a homomorphism to H. The oriented chromatic number of an undire...
Eric Sopena
DM
2007
114views more  DM 2007»
13 years 5 months ago
An inequality for the group chromatic number of a graph
—We give an inequality for the group chromatic number of a graph as an extension of Brooks’ Theorem. Moreover, we obtain a structural theorem for graphs satisfying the equality...
Hong-Jian Lai, Xiangwen Li, Gexin Yu
DM
1998
118views more  DM 1998»
13 years 4 months ago
Chromatic Ramsey numbers
Suppose G is a graph. The chromatic Ramsey number rc(G) of G is the least integer m such that there exists a graph F of chromatic number m for which the following is true: For any...
Xuding Zhu
JGT
2006
99views more  JGT 2006»
13 years 5 months ago
On the circular chromatic number of circular partitionable graphs
This paper studies the circular chromatic number of a class of circular partitionable graphs. We prove that an infinite family of circular partitionable graphs have
Arnaud Pêcher, Xuding Zhu