1215 search results - page 122 / 243 » Combinatorics |
CPM
2007
Springer
15 years 9 months ago
2007
Springer
96
Voted
CPM
2005
Springer
15 years 9 months ago
2005
Springer
CPM
2010
Springer
15 years 8 months ago
2010
Springer
108
Voted
COMBINATORICS
2007
15 years 3 months ago
2007
We determine the exact and asymptotic number of unlabeled outerplanar graphs. The exact number gn of unlabeled outerplanar graphs on n vertices can be computed in polynomial time,...
109
Voted
COMBINATORICS
2004
15 years 3 months ago
2004
For every real p > 0 and simple graph G, set f (p, G) = uV (G) dp (u) , and let (r, p, n) be the maximum of f (p, G) taken over all Kr+1-free graphs G of order n. We prove tha...