244 search results - page 25 / 49 » Intervalizing k-Colored Graphs |
109
Voted
DM
2008
15 years 2 months ago
2008
For two graphs G and H, let the mixed anti-Ramsey numbers, maxR(n; G, H), (minR(n; G, H)) be the maximum (minimum) number of colors used in an edge-coloring of a complete graph wi...
123
Voted
JCT
2007
15 years 2 months ago
2007
Hyperplanes of the form xj = xi + c are called affinographic. For an affinographic hyperplane arrangement in Rn, such as the Shi arrangement, we study the function f(m) that counts...
144
Voted
COMGEO
2007
ACM
15 years 2 months ago
2007
ACM
The slope-number of a graph G is the minimum number of distinct edge slopes in a straight-line drawing of G in the plane. We prove that for Δ 5 and all large n, there is a Δ-reg...
97
Voted
ACL
1998
15 years 4 months ago
1998
Word graphs are able to represent a large number of different utterance hypotheses in a very compact manner. However, usually they contain a huge amount of redundancy in terms of ...
116
Voted
FSTTCS
2010
Springer
15 years 18 days ago
2010
Springer
ABSTRACT. The maximum independent set problem (MAXIS) on general graphs is known to be NPhard to approximate within a factor of n1-, for any > 0. However, there are many "...