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 ...
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...
—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...
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...
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