Efficient subgraphs packing (Q1321999)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Efficient subgraphs packing |
scientific article; zbMATH DE number 562387
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient subgraphs packing |
scientific article; zbMATH DE number 562387 |
Statements
Efficient subgraphs packing (English)
0 references
28 August 1994
0 references
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 G. Cornuéjols, D. Hartvigsen, and W. R. Pulleyblank, and P. Hell and D. G. Kirkpatrick.
0 references
matching
0 references
packing
0 references
