Journal ArticleOPEN ACCESS

Efficient subgraph packing

Journal of Combinatorial Theory, Series B (1993) 59(1) 106-121
DOI: 10.1006/jctb.1993.1058
33Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

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.

Cite

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

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free