725 search results - page 47 / 145 » Bounding Degrees on RPL |
187
click to vote
DM
2008
15 years 6 months ago
2008
One of the basic results in graph theory is Dirac's theorem, that every graph of order n 3 and minimum degree n/2 is Hamiltonian. This may be restated as: if a graph of ord...
161
click to vote
DM
2007
15 years 6 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 ...
173
click to vote
IPL
2002
15 years 6 months ago
2002
We consider two aesthetic criteria for the visualization of rooted trees: inclusion and tip-over. Finding the minimum area layout according to either of these two standards is an ...
121
Voted
GD
2004
Springer
16 years 2 days ago
2004
Springer
We prove that the number of distinct weaving patterns produced by n semi-algebraic curves in R3 defined coordinate-wise by polynomials of degrees bounded by some constant d, is b...
173
click to vote
CCCG
2010
15 years 8 months ago
2010
In this paper we devise a new geometric spanner based on a generalization of the known Stable Roommates algorithm. This spanner is on the "path" between the Yao graph an...