1302 search results - page 19 / 261 » On the Strong Chromatic Number |
157
click to vote
JGT
2008
15 years 6 months ago
2008
The measurable list chromatic number of a graph G is the smallest number such that if each vertex v of G is assigned a set L(v) of measure in a fixed atomless measure space, the...
169
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Map vertices of a graph to (not necessarily distinct) points of the plane so that two adjacent vertices are mapped at least a unit distance apart. The plane-width of a graph is th...
194
click to vote
IPL
2008
15 years 6 months ago
2008
A homomorphism from an oriented graph G to an oriented graph H is an arc-preserving mapping f from V(G) to V(H), that is f(x)f(y) is an arc in H whenever xy is an arc in G. The or...
155
click to vote
IWOCA
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Although there exist many polynomial algorithms for NPhard problems running on a bounded clique-width expression of the input graph, there exists only little comparable w...
134
click to vote
COMBINATORICS
2006
15 years 6 months ago
2006
We prove the following extension of an old result of Andr