70 search results - page 1 / 14 » Degree sequence and supereulerian graphs |
DM
2008
13 years 11 months ago
2008
A sequence d = (d1, d2,
SODA
2010
ACM
14 years 8 months ago
2010
ACM
CPC
1998
13 years 10 months ago
1998
Given a sequence of non-negative real numbers 0 1 ::: which sum to 1, we consider a random graph having approximately in vertices of degree i. In 12] the authors essentially show ...
RSA
2008
13 years 10 months ago
2008
It is now known that many properties of the objects in certain combinatorial structures are equivalent, in the sense that any object possessing any of the properties must of neces...
SIAMDM
2010
13 years 5 months ago
2010
Let d = d1 d2