82 search results - page 14 / 17 » combinatorica 2008 |
COMBINATORICA
2004
14 years 9 months 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 ...
46
Voted
DM
2006
14 years 9 months ago
2006
The notion of the carvingwidth of a graph was introduced by Seymour and Thomas [Call routing and the ratcatcher, Combinatorica
COMBINATORICA
2008
14 years 9 months ago
2008
Abstract. We relate signs of edge-colorings (as in classical Penrose's result) with "Pfaffian labelings", a generalization of Pfaffian orientations, whereby edges ar...
COMBINATORICA
2008
14 years 9 months ago
2008
We introduce a new combinatorial object, the double-permutation sequence, and use it to encode a family of mutually disjoint compact convex sets in the plane in a way that capture...
67
Voted
COMBINATORICA
2004
14 years 9 months ago
2004
Consider a k-element subset P of the plane. It is known that the maximum number of sets similar to P that can be found among n points in the plane is (n2 ) if and only if the cros...