241 search results - page 23 / 49 » Degree Bounded Spanning Trees |
105
click to vote
DM
2007
15 years 1 months ago
2007
By Petersen’s theorem, a bridgeless cubic multigraph has a 2-factor. H. Fleischner generalised this result to bridgeless multigraphs of minimum degree at least three by showing ...
124
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
We obtain new lower and upper bounds for the maximum multiplicity of some weighted and, respectively, non-weighted common geometric graphs drawn on n points in the plane in genera...
111
click to vote
DAM
2007
15 years 1 months ago
2007
We study the following problem: Given a tree G and a finite set of trees H, find a subset O of the edges of G such that G − O does not contain a subtree isomorphic to a tree f...
116
click to vote
COMPGEOM
1993
ACM
15 years 6 months ago
1993
ACM
For a polygon P, the bounded Voronoi diagram of P is a partition of P into regions assigned to the vertices of P. A point p inside P belongs to the region of a vertex v if and onl...
107
click to vote
COMPGEOM
1993
ACM
15 years 6 months ago
1993
ACM
We consider graphs such as the minimum spanning tree, minimum Steiner tree, minimum matching, and traveling salesman tour for n points in the d-dimensional unit cube. For each of ...