TY  - JOUR
A1  - Beckenbach, Isabel
A1  - Scheidweiler, Robert
T1  - Perfect ƒ-Matchings and ƒ-Factors in Hypergraphs - A Combinatorial Approach
T2  - Discrete Mathematics
N2  - We prove characterizations of the existence of perfect ƒ-matchings in uniform mengerian and perfect hypergraphs. Moreover, we investigate the ƒ-factor problem in balanced hypergraphs. For uniform balanced hypergraphs we prove two existence theorems with purely combinatorial arguments, whereas for non-uniform balanced hypergraphs we show that the ƒ-factor problem is NP-hard.
Y1  - 2016
UR  - https://opus.bibliothek.fh-aachen.de/opus4/frontdoor/index/index/docId/7874
SN  - 2192-7782
N1  - Als Volltext auch bei ZIB (Zuse Institute Berlin)
VL  - 240
IS  - 10
SP  - 2499
EP  - 2506
PB  - Elsevier
CY  - Amsterdam
ER  -