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

From This Paper

Topics from this paper.
8 Citations
27 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 27 references

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

  • Jean Blair, M Sandra
  • Graph Classes — A survey . SIAM
  • 1999

Beineke and Robert C . Vandell . Decycling graphs

  • W Lowell
  • J . Graph Theory
  • 1997

Adding an identity to a totally unimodular matrix

  • C. W. Ko, F. B. Shepherd
  • 1994
2 Excerpts

Similar Papers

Loading similar papers…