Induced matching extendable graphs

@article{Yuan1998InducedME,
  title={Induced matching extendable graphs},
  author={Jinjiang Yuan},
  journal={Journal of Graph Theory},
  year={1998},
  volume={28},
  pages={203-213}
}
We say that a simple graphG is induced matching extendable, shortly IM-extendable, if every induced matching of G is included in a perfect matching of G. The main results of this paper are as follows: (1) For every connected IM-extendable graph G with |V (G)| ≥ 4, the girth g(G) ≤ 4. (2) If G is a connected IM-extendable graph, then |E(G)| ≥ 2 |V (G)| − 2; the equality holds if and only if G ∼= T ×K2, where T is a tree. (3) The only 3-regular connected IM-extendable graphs are Cn × K2, for n… CONTINUE READING
7 Citations
6 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-6 of 6 references

Induced matchings

  • K. Cameron
  • Discrete Appl. Math. 24
  • 1989
2 Excerpts

Matching theory

  • L. Lovasz, M. D. Plummer
  • Elsevier Science Publishers, B. V. North Holland
  • 1985
2 Excerpts

Similar Papers

Loading similar papers…