50 search results - page 1 / 10 » Partitions of Complete Geometric Graphs into Plane Trees |
149
Voted
GD
2004
Springer
15 years 11 months ago
2004
Springer
Consider the following question: does every complete geometric graph K2n have a partition of its edge set into n plane spanning trees? We approach this problem from three directio...
164
click to vote
CCCG
2009
15 years 7 months ago
2009
A set of n points in the plane is a universal pointset for a given class of graphs, if any n-vertex graph in that class can be embedded in the plane so that vertices are mapped to...
156
click to vote
GC
2007
Springer
15 years 6 months ago
2007
Springer
We develop Gray code enumeration schemes for geometric graphs in the plane. The considered graph classes include plane straight-line graphs, plane spanning trees, and connected pl...
144
click to vote
COCOON
2009
Springer
16 years 19 days ago
2009
Springer
It is shown that for every finite set of disjoint convex polygonal obstacles in the plane, with a total of n vertices, the free space around the obstacles can be partitioned into ...
149
click to vote
GD
1998
Springer
15 years 10 months ago
1998
Springer
We define the geometric thickness of a graph to be the smallest number of layers such that we can draw the graph in the plane with straightline edges and assign each edge to a lay...