Unicycle graphs and uniquely restricted maximum matchings

Vadim E. Levit, Eugen Mandrescu

Research output: Contribution to journalArticlepeer-review

5 Scopus citations


A matching M is called uniquely restricted in a graph G if it is the unique perfect matching of the subgraph induced by the vertices that M saturates. G is a unicycle graph if it owns only one cycle. Golumbic, Hirst and Lewenstein observed that for a tree or a graph with only odd cycles the size of a maximum uniquely restricted matching is equal to the matching number of the graph. In this paper we characterize unicycle graphs enjoying this equality. Moreover, we describe unicycle graphs with only uniquely restricted maximum matchings. Using these findings, we show that unicycle graphs having only uniquely restricted maximum matchings can be recognized in polynomial time.

Original languageEnglish
Pages (from-to)261-265
Number of pages5
JournalElectronic Notes in Discrete Mathematics
StatePublished - 15 Oct 2005
Externally publishedYes


  • greedoid
  • local maximum stable set
  • uniquely restricted matching


Dive into the research topics of 'Unicycle graphs and uniquely restricted maximum matchings'. Together they form a unique fingerprint.

Cite this