Abstract
A matching of G can be viewed as a set of disjoint subgraphs of G each isomorphic to K2. A natural generalization is a set of disjoint subgraphs each isomorphic to a fixed graph H, or to a member of a fixed family H of graphs. This is a survey of such packing problems. It covers older work of Corneujols, Hartvigsen, and Pulleyblank, of Loebl and Poljak, and of Kirkpatrick and the author, and reports on new results of Kaneko, Kano, Katona, Kiralyi, Brewster, Pantel, Rizzi, Yeo, Hartvigsen, and the author. The emphasis is on illustrating the use of NP-completeness in ‘predicting’ good characterizations.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callSimilar Papers
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
