26 search results - page 2 / 6 » Edge Disjoint Graph Spanners of Complete Graphs and Complete... |
107
click to vote
EJC
2007
15 years 3 months ago
2007
Let K− r denote the graph obtained from Kr by deleting one edge. We show that for every integer r ≥ 4 there exists an integer n0 = n0(r) such that every graph G whose order n ...
109
Voted
SIAMDM
2010
14 years 10 months ago
2010
The routing number rt(G) of a connected graph G is the minimum integer r so that every permutation of vertices can be routed in r steps by swapping the ends of disjoint edges. In t...
107
Voted
COMBINATORICS
1999
15 years 3 months ago
1999
It is proven that for every fixed h, a and b, a graph with n vertices and minimum degree at least h-1 h n, which contains no copy of Kb (the complete graph with b vertices), conta...
159
Voted
WADS
2007
Springer
15 years 9 months ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
129
Voted
APPROX
2009
Springer
15 years 10 months ago
2009
Springer
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...