376 search results - page 3 / 76 » Near-optimum Universal Graphs for Graphs with Bounded Degree... |
WG
2009
Springer
14 years 3 months ago
2009
Springer
COMBINATORICS
2006
13 years 8 months ago
2006
Abstract. The geometric thickness of a graph G is the minimum integer k such that there is a straight line drawing of G with its edge set partitioned into k plane subgraphs. Eppste...
FOCS
2002
IEEE
14 years 1 months ago
2002
IEEE
We consider the problem of testing 3-colorability in the bounded-degree model. We show that, for small enough ε, every tester for 3colorability must have query complexity Ω(n)....
GC
2010
Springer
13 years 7 months ago
2010
Springer
In this paper, we give a sufficient condition for a graph to have a degree bounded spanning tree. Let n ≥ 1, k ≥ 3, c ≥ 0 and G be an n-connected graph. Suppose that for eve...
SIAMCOMP
2011
12 years 11 months ago
2011
We consider the problem of testing graph expansion (either vertex or edge) in the bounded degree model [10]. We give a property tester that given a graph with degree bound d, an ex...