215 search results - page 1 / 43 » On extremal k-outconnected graphs |
64
Voted
EXTREME
2003
ACM
15 years 3 months ago
2003
ACM
80
Voted
ALGORITHMS
2010
14 years 7 months ago
2010
: Graph search algorithms have exploited graph extremities, such as the leaves of a tree and the simplicial vertices of a chordal graph. Recently, several well-known graph search a...
70
Voted
DM
2008
14 years 10 months ago
2008
Let G be a minimally k-connected graph with n nodes and m edges. Mader proved that if n 3k - 2 then m k(n - k), and for n 3k - 1 an equality is possible if, and only if, G is t...
WWW
2008
ACM
15 years 11 months ago
2008
ACM
We analyze dependencies in power law graph data (Web sample, Wikipedia sample and a preferential attachment graph) using statistical inference for multivariate regular variation. ...
72
Voted
ARSCOM
2007
14 years 10 months ago
2007
Let us denote by EX (m, n; {C4, . . . , C2t}) the family of bipartite graphs G with m and n vertices in its classes that contain no cycles of length less than or equal to 2t and h...