Packing subgraphs in a graph

  • Authors:

  • G. Cornuéjols;D. Hartvigsen;W. Pulleyblank

  • Affiliations:

  • CORE, 34 Voie du Roman Pays, 1348 Louvain-la-Neuve, Belgium;CORE, 34 Voie du Roman Pays, 1348 Louvain-la-Neuve, Belgium;Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario, Canada N2L 3G1

  • Venue:
  • Operations Research Letters
  • Year:
  • 1982

Quantified Score

Hi-index 0.00

Visualization

Abstract

We show that the problem of packing edges and triangles in a graph in order to cover the maximum number of nodes can be solved in polynomial time. More generally we present results for the problem of packing edges and a family of hypomatchable subgraphs.