3267 search results - page 53 / 654 » Generalized quasirandom graphs |
198
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
Existing approaches to analyzing the asymptotics of graph Laplacians typically assume a well-behaved kernel function with smoothness assumptions. We remove the smoothness assumpti...
156
click to vote
SIAMDM
2008
15 years 6 months ago
2008
We consider the class of graphs that contain no bull, no odd hole, and no antihole of length at least five. We present a new algorithm that colors optimally the vertices of every g...
145
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
Let k = (k1, . . . , kn) be a sequence of n integers. For an increasing monotone graph property P we say that a base graph G = ([n], E) is k-resilient with respect to P if for eve...
224
click to vote
ICALP
2011
Springer
14 years 9 months ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
139
click to vote
GG
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Hierarchical graph transformation as defined in [1, 2] extends double-pushout graph transformation in the spirit of term rewriting: Graphs are provided with hierarchical...