785 search results - page 9 / 157 » Embedding a Forest in a Graph |
136
Voted
GD
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. We consider the problem of simultaneous embedding of planar graphs. We demonstrate how to simultaneously embed a path and an n-level planar graph and how to use radial em...
119
click to vote
JGT
2006
15 years 3 months ago
2006
We find a lower bound for the proportion of face boundaries of an embedded graph that are nearly
116
Voted
SIAMDM
2008
15 years 3 months ago
2008
A well-known theorem of Nash-Williams and Tutte gives a necessary and sufficient condition for the existence of k edge-disjoint spanning trees in an undirected graph. A corollary o...
115
click to vote
COMBINATORICS
2006
15 years 3 months ago
2006
Let G be a graph. A vertex labeling of G is distinguishing if the only label-preserving automorphism of G is the identity map. The distinguishing number of G, D(G), is the minimum...
162
Voted
SODA
1992
ACM
15 years 4 months ago
1992
ACM
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...