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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.