105 search results - page 7 / 21 » Euler's Partition Theorem |
DM
2006
14 years 10 months ago
2006
Berge's conjecture from 1982 on path partitions in directed graphs generalizes and extends Dilworth's Theorem and the Greene-Kleitman Theorem which are well known for pa...
101
click to vote
JCT
2008
14 years 10 months ago
2008
A hole in a graph is an induced cycle on at least four vertices. A graph is Berge if it has no odd hole and if its complement has no odd hole. In 2002, Chudnovsky, Robertson, Seym...
EJC
2010
14 years 10 months ago
2010
In a recent paper, Amini et al. introduced a general framework to prove duality theorems between tree decompositions and their dual combinatorial object. They unify all known ad-h...
SMA
2009
ACM
15 years 4 months ago
2009
ACM
A key problem when interpolating a network of curves occurs at vertices: an algebraic condition called the vertex enclosure constraint must hold wherever an even number of curves ...
CAGD
2000
14 years 10 months ago
2000
This paper presents a method for estimating curvature values of a surface, which is given only approximatively, e.g., by measured data. The presented method requires estimates of ...