Title of article
Efficient Subgraph Packing
Author/Authors
Loebl، نويسنده , , M. and Poljak، نويسنده , , S.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1993
Pages
16
From page
106
To page
121
Abstract
We are concerned with a natural generalization of the matching problem: the packing of graphs from a pregiven family. We characterize completely the complexity of deciding the existence of a perfect packing, if the pregiven family consists of two graphs, one of which is one edge on two vertices. Our results complete the work of Cornuejols. Hartvigsen, and Pulleyblank, and Hell and Kirkpatrick.
Journal title
Journal of Combinatorial Theory Series B
Serial Year
1993
Journal title
Journal of Combinatorial Theory Series B
Record number
1525789
Link To Document