ALBERT — All Library Books, journals and Electronic Records Telegrafenberg

Hits per page

hit 1 - 1 | 1 hit

Sorting

Electronic Resource

b-matching degree-sequence polyhedra (1991)

Cunningham, William H. ; Green-Krótki, Jan

Springer

Combinatorica 11 (1991), S. 219-230

add to mindlist on the mindlist

Details

ISSN: 1439-6912

Keywords: 05 C 70 ; 15 A 39

Source: Springer Online Journal Archives 1860-2000

Topics: Mathematics

Notes: Abstract A capacitatedb-matching in a graph is an assignment of non-negative integers to edges, each at most a given capacity and the sum at each vertex at most a given bound. Its degree sequence is the vector whose components are the sums at each vertex. We give a linear-inequality description of the convex hull of degree sequences of capacitatedb-matchings of a graph. This result includes as special cases theorems of Balas-Pulleyblank on matchable sets and Koren on degree sequences of simple graphs. We also give a min-max separation theorem, and describe a connection with submodular functions.

Type of Medium: Electronic Resource

URL: http://dx.doi.org/10.1007/BF01205074

Permalink

	Location	Call Number	Expected	Availability

Others were also interested in ...

Paper (German National Licenses)

Fulltext

hit 1 - 1 | 1 hit