On the completeness of a generalized matching problem

A perfect matching in a graph H may be viewed as a collection of subgraphs of H, each of which is isomorphic to K2, whose vertex sets partition the vertex set of H. This is naturally generalized by replacing K2 by an arbitrary graph G. We show that if G contains a component with at least three vertices then this generalized matching problem is NP-complete. These generalized matchings have numerous applications including the minimization of second-order conflicts in examination scheduling.

[1]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[2]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[3]  Stephen T. Hedetniemi,et al.  A Linear Algorithm for the Domination Number of a Tree , 1975, Inf. Process. Lett..

[4]  L. Hubert.  Some applications of graph theory to clustering , 1974 .

[5]  David S. Johnson,et al.  The Complexity of Near-Optimal Graph Coloring , 1976, J. ACM.

[6]  A. J. Cole,et al.  The preparation of examination time-tables using a small-store computer , 1964, Comput. J..

[7]  D. J. A. Welsh,et al.  An upper bound for the chromatic number of a graph and its application to timetabling problems , 1967, Comput. J..

[8]  David C. Wood.  A system for computing university examination timetables , 1968, Comput. J..

[9]  A. K. Hope.  Component placement through graph partitioning in computer-aided printed-wiring-board design , 1972 .

[10]  J. E. L. Peck,et al.  Algorithm 286: Examination scheduling , 1966, CACM.

[11]  J. Edmonds.  Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.

[12]  Frank Harary,et al.  Graph Theory , 2016 .

[13]  David S. Johnson,et al.  Some simplified NP-complete problems , 1974, STOC '74.

[14]  David C. Wood,et al.  A technique for colouring a graph applicable to large scale timetabling problems , 1969, Computer/law journal.

[15]  James F. Gimpel,et al.  Covering Points of a Digraph with Point-Disjoint Paths and Its Application to Code Optimization , 1977, JACM.