Sciweavers

751 search results - page 18 / 151
» The Distinguishing Chromatic Number
Sort
View
CMA
2010
73views more  CMA 2010»
13 years 4 months ago
On the chromatic number of integral circulant graphs
Aleksandar Ilic, Milan Basic
ARSCOM
2006
132views more  ARSCOM 2006»
13 years 7 months ago
C-Perfect K-Uniform Hypergraphs
In this paper we define the concept of clique number of uniform hypergraph and study its relationship with circular chromatic number and clique number. For every positive integer ...
Changiz Eslahchi, Arash Rafiey
IPL
2006
153views more  IPL 2006»
13 years 7 months ago
Oriented vertex and arc colorings of outerplanar graphs
A homomorphism from an oriented graph G to an oriented graph H is an arc-preserving mapping from V (G) to V (H), that is (x)(y) is an arc in H whenever xy is an arc in G. The orie...
Alexandre Pinlou, Eric Sopena