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

Todd Fenstermacher; Soumendra Ganguly; Stephen Hedetniemi; Renu Laskar

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

Combinatorics 2018-05-10 v1

Authors: Todd Fenstermacher , Soumendra Ganguly , Stephen Hedetniemi , Renu Laskar

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.

Keywords

graph theory graph pebbling bipartite graphs

Cite

@article{arxiv.1805.03334,
  title  = {$P$-Matchings in Graphs: A Brief Survey with Some Open Problems},
  author = {Todd Fenstermacher and Soumendra Ganguly and Stephen Hedetniemi and Renu Laskar},
  journal= {arXiv preprint arXiv:1805.03334},
  year   = {2018}
}

Comments

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)

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

Abstract

Keywords

Cite

Comments

Related papers