$P$-Matchings in Graphs: A Brief Survey with Some Open Problems
Abstract
For a graph $G=(V,E),$ a matching $M$ is a set of independent edges. The topic of matchings is well studied in graph theory. In this paper many varieties of matchings are discussed.
- Publication:
-
arXiv e-prints
- Pub Date:
- May 2018
- DOI:
- arXiv:
- arXiv:1805.03334
- Bibcode:
- 2018arXiv180503334F
- Keywords:
-
- Mathematics - Combinatorics
- E-Print:
- A portion of these results were presented at the 49th SE International Conference on Combinatorics, Graph Theory and Computing, March 5-9, 2018 and will appear in the conference proceedings, Congressus Numerantium (2018)