4298 search results - page 19 / 860 » Measurable chromatic numbers |
DAM
2010
14 years 12 months ago
2010
In the minimum sum edge coloring problem, we aim to assign natural numbers to edges of a graph, so that adjacent edges receive different numbers, and the sum of the numbers assign...
104
click to vote
STOC
1994
ACM
15 years 3 months ago
1994
ACM
We indicate strong non-approximability factors for central problems: N1/4 for Max Clique; N1/10 for Chromatic Number; and 66/65 for Max 3SAT. Underlying the Max Clique result is a...
CORR
2008
Springer
14 years 12 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...
121
click to vote
IPL
2008
14 years 11 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...
69
Voted
COMBINATORICS
2006
14 years 11 months ago
2006
We prove the following extension of an old result of Andr