1857 search results - page 6 / 372 » Minimum Degree Orderings |
JGT
2006
14 years 11 months ago
2006
It is well known that every bipartite graph with vertex classes of size n whose minimum degree is at least n/2 contains a perfect matching. We prove an analogue of this result for...
124
click to vote
SAC
2006
ACM
14 years 11 months ago
2006
ACM
A total order protocol is a fundamental building block in the construction of distributed fault-tolerant applications. Unfortunately, the implementation of such a primitive can be...
104
click to vote
CCCG
2006
15 years 1 months ago
2006
We show that any tree whose maximum degree is at most 10 can be drawn in 3-space such that it is the minimum spanning tree of its vertices.
JCT
2008
14 years 11 months ago
2008
The old well-known result of Chartrand, Kaugars and Lick [1] says that every k-connected graph G with minimum degree at least 3k/2 has a vertex v such that G - v is still k-connec...
68
Voted
COMBINATORICS
2006
14 years 11 months ago
2006
We prove the following extension of an old result of Andr