Graphs in which some and every maximum matching is uniquely restricted

DOI10.1002/jgt.22239zbMath1401.05239arXiv1504.02250OpenAlexW2963501449MaRDI QIDQ4553727

Uéverton dos Santos Souza, Dieter Rautenbach, Lucia Draque Penso

Publication date: 31 October 2018

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1504.02250

zbMATH Keywords

maximum matchinguniquely restricted matching

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (5)

Perfect matching cuts partitioning a graph into complementary subgraphs ⋮ On the hardness of deciding the equality of the induced and the uniquely restricted matching number ⋮ On the equality of the induced matching number and the uniquely restricted matching number for subcubic graphs ⋮ On some hard and some tractable cases of the maximum acyclic matching problem ⋮ Approximating maximum uniquely restricted matchings in bipartite graphs

This page was built for publication: Graphs in which some and every maximum matching is uniquely restricted