Generalized subgraph-restricted matchings in graphs

@article{Goddard2005GeneralizedSM,
title={Generalized subgraph-restricted matchings in graphs},
author={Wayne Goddard and Sandra Mitchell Hedetniemi and Stephen T. Hedetniemi and Renu C. Laskar},
journal={Discrete Mathematics},
year={2005},
volume={293},
pages={129-138}
}

For a graph property P, we define a P-matching as a set M of disjoint edges such that the subgraph induced by the vertices incident to M has property P. Previous examples include strong/induced matchings and uniquely restricted matchings. We explore the general properties of P-matchings, but especially the cases where P is the property of being acyclic or the property of being disconnected. We consider bounds on and the complexity of the maximum cardinality of a P-matching and the minimum… CONTINUE READING

Hedetniemi , Stephen T . Hedetniemi , Renu Laskar , and H . B . Walikar . Generalized vertex covers in graphs . Preprint . [ 3 ] Andreas Brandstadt , Van Bang Le , and Jeremy P . Spinrad