$P$-Matchings in Graphs: A Brief Survey with Some Open Problems

Renu Laskar; Soumendra Ganguly; Stephen Hedetniemi; Todd Fenstermacher

arxiv: 1805.03334 · v1 · pith:Y337ZMIBnew · submitted 2018-05-09 · 🧮 math.CO

P-Matchings in Graphs: A Brief Survey with Some Open Problems

Todd Fenstermacher , Soumendra Ganguly , Stephen Hedetniemi , Renu Laskar This is my paper

classification 🧮 math.CO

keywords matchingsgraphbriefdiscussededgesgraphsindependentmany

0 comments

read the original 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.

This paper has not been read by Pith yet.

P-Matchings in Graphs: A Brief Survey with Some Open Problems

discussion (0)