Sciweavers

241 search results - page 23 / 49
» Degree Bounded Spanning Trees
Sort
View
DM
2007
149views more  DM 2007»
13 years 8 months ago
Even subgraphs of bridgeless graphs and 2-factors of line graphs
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 ...
Bill Jackson, Kiyoshi Yoshimoto
CORR
2010
Springer
168views Education» more  CORR 2010»
13 years 5 months ago
Bounds on the maximum multiplicity of some common geometric graphs
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...
Adrian Dumitrescu, André Schulz, Adam Sheff...
DAM
2007
70views more  DAM 2007»
13 years 8 months ago
Tree-edges deletion problems with bounded diameter obstruction sets
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...
Dekel Tsur
COMPGEOM
1993
ACM
14 years 18 days ago
A Linear-Time Randomized Algorithm for the Bounded Voronoi Diagram of a Simple Polygon
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...
Rolf Klein, Andrzej Lingas
COMPGEOM
1993
ACM
14 years 18 days ago
Worst-Case Bounds for Subadditive Geometric Graphs
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 ...
Marshall W. Bern, David Eppstein