Graphs in which some and every maximum matching is uniquely restricted
Combinatorics
2015-04-10 v1
Abstract
A matching in a graph is uniquely restricted if there is no matching in that is distinct from but covers the same vertices as . Solving a problem posed by Golumbic, Hirst, and Lewenstein, we characterize the graphs in which some maximum matching is uniquely restricted. Solving a problem posed by Levit and Mandrescu, we characterize the graphs in which every maximum matching is uniquely restricted. Both our characterizations lead to efficient recognition algorithms for the corresponding graphs.
Cite
@article{arxiv.1504.02250,
title = {Graphs in which some and every maximum matching is uniquely restricted},
author = {Lucia Draque Penso and Dieter Rautenbach and Ueverton dos Santos Souza},
journal= {arXiv preprint arXiv:1504.02250},
year = {2015}
}