1857 search results - page 12 / 372 » Minimum Degree Orderings |
JGT
2007
13 years 9 months ago
2007
A well-known theorem of Mader [5] states that highly connected subgraphs can be forced in finite graphs by assuming a high minimum degree. Solving a problem of Diestel [2], we ex...
CCCG
2001
13 years 11 months ago
2001
We show that every set of n points in general position has a minimum pseudo-triangulation whose maximum vertex degree is five. In addition, we demonstrate that every point set in ...
SIAMCOMP
2000
13 years 9 months ago
2000
The bipartite crossing number problem is studied, and a connection between this problem and the linear arrangement problem is established. It is shown that when the arboricity is ...
IROS
2006
IEEE
14 years 3 months ago
2006
IEEE
— Humanoid robots are routinely engaged in tasks requiring the coordination between multiple degrees of freedom and sensory inputs, often achieved through the use of sensorymotor...
SIAMDM
2010
13 years 4 months ago
2010
Bounds on the minimum degree and on the number of vertices attaining it have been much studied for finite edge-/vertex-minimally kconnected/k-edge-connected graphs. We give an ove...