1857 search results - page 36 / 372 » Minimum Degree Orderings |
103
Voted
CAD
2006
Springer
15 years 1 months ago
2006
Springer
The minimum distance computation problem between two surfaces is very important in many applications such as robotics, CAD/CAM and computer graphics. Given two implicit algebraic ...
83
Voted
IM
2007
15 years 29 days ago
2007
We examine the relationship of a graph G and its random subgraphs which are defined by independently choosing each edge with probability p. Suppose that G has a spectral gap λ (...
COMBINATORICA
2004
15 years 27 days ago
2004
It is proved in this paper that every bipartite graphic sequence with the minimum degree 2 has a realization that admits a nowhere-zero 4-flow. This result implies a conjecture ...
99
Voted
GC
2002
Springer
15 years 25 days ago
2002
Springer
We prove that for every c > 0 there exists a constant K = K(c) such that every graph G with n vertices and minimum degree at least cn contains a cycle of length t for every even...
103
Voted
APPML
2011
14 years 8 months ago
2011
The k-domination number of a graph is the cardinality of a smallest set of vertices such that every vertex not in the set is adjacent to at least k vertices of the set. We prove t...