50 search results - page 1 / 10 » On the Strong Chromatic Number of Random Graphs |
CPC
2008
14 years 10 months ago
2008
104
click to vote
CORR
2010
Springer
14 years 10 months ago
2010
Springer
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...
CPC
2004
14 years 10 months ago
2004
The strong chromatic number, S(G), of an n-vertex graph G is the smallest number k such that after adding kn/k-n isolated vertices to G and considering any partition of the vertic...
ENDM
2008
14 years 10 months ago
2008
A strong oriented k-coloring of an oriented graph G is a homomorphism from G to H having k vertices labelled by the k elements of an abelian additive group M, such that for any p...
104
Voted
RSA
2008
14 years 9 months ago
2008
: Given a graph G and an integer k, two players take turns coloring the vertices of G one by one using k colors so that neighboring vertices get different colors. The first player ...