Sciweavers

4298 search results - page 17 / 860
» Measurable chromatic numbers
Sort
View
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
CC
2006
Springer
133views System Software» more  CC 2006»
13 years 7 months ago
The complexity of chromatic strength and chromatic edge strength
The sum of a coloring is the sum of the colors assigned to the vertices (assuming that the colors are positive integers). The sum (G) of graph G is the smallest sum that can be ach...
Dániel Marx