Extending matchings in graphs: A survey

@article{Plummer1994ExtendingMI,
  title={Extending matchings in graphs: A survey},
  author={Michael D. Plummer},
  journal={Discrete Mathematics},
  year={1994},
  volume={127},
  pages={277-292}
}
Gallai and Edmonds independently obtained a canonical decomposition of graphs in terms of their maximum matchings. Unfortunately, one of the degenerate cases for their theory occurs when the graph in question has a perfect matching (also known as a l-factor). Kotzig, Lovasz and others subsequently developed a further decomposition of such graphs. Among the… CONTINUE READING

Topics

Statistics

051015'94'97'00'03'06'09'12'15'18
Citations per Year

94 Citations

Semantic Scholar estimates that this publication has 94 citations based on the available data.

See our FAQ for additional information.