3267 search results - page 39 / 654 » Generalized quasirandom graphs |
COMPGEOM
2009
ACM
15 years 5 months ago
2009
ACM
It was shown in [11] that any orientable graph of genus g can be probabilistically embedded into a graph of genus g − 1 with constant distortion. Removing handles one by one giv...
JGT
2011
14 years 6 months ago
2011
A graph G = (V, E) is called (k, k )-total weight choosable if the following holds: For any total list assignment L which assigns to each vertex x a set L(x) of k real numbers, an...
122
click to vote
NETWORKS
2011
14 years 1 months ago
2011
A graph is terminal ∆ − Y -reducible if, it can be reduced to a distinguished set of terminal vertices by a sequence of series-parallel reductions and ∆−Y -transformations...
109
click to vote
APPROX
2011
Springer
13 years 11 months ago
2011
Springer
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...
LATIN
2000
Springer
15 years 2 months ago
2000
Springer
We look at the minimal size of a maximal matching in general, bipartite and