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. © 1993 by Academic Press, Inc.
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for freeCite
CITATION STYLE
APA
Loebl, M., & Poljak, S. (1993). Efficient subgraph packing. Journal of Combinatorial Theory, Series B, 59(1), 106–121. https://doi.org/10.1006/jctb.1993.1058
Readers' Seniority
Readers' Discipline
