3267 search results - page 36 / 654 » Generalized quasirandom graphs |
110
Voted
WADT
1998
Springer
15 years 4 months ago
1998
Springer
We investigate the rewrite relation over graphs induced by constructor-based weakly orthogonal graph rewriting systems. It is well known that this relation is not confluent in gene...
103
Voted
DAM
2006
15 years 21 days ago
2006
We prove that a triangle-free graph G is a tolerance graph if and only if there exists a set of consecutively ordered stars that partition the edges of G. Since tolerance graphs a...
111
Voted
COMBINATORICS
2004
15 years 15 days ago
2004
In the 1960's, Tutte presented a decomposition of a 2-connected finite graph into 3-connected graphs, cycles and bonds. This decomposition has been used to reduce problems on...
107
click to vote
KDID
2003
15 years 2 months ago
2003
We introduce generalized version space trees, a novel data structure that serves as a condensed representation in inductive databases for graph mining. Generalized version space tr...
106
Voted
DM
2002
15 years 14 days ago
2002
Let f1 and f2 be graph parameters. The Ramsey number r(f1 m; f2 n) is defined as the minimum integer N such that any graph G on N vertices, either f1(G) m or f2(G) n. A genera...