Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

On Unicyclic Graphs with Uniquely Restricted Maximum Matchings

  • Original Paper
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

A graph is called unicyclic if it owns only one cycle. 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. Clearly, μ r (G) ≤ μ(G), where μ r (G) denotes the size of a maximum uniquely restricted matching, while μ(G) equals the matching number of G. In this paper we study unicyclic bipartite graphs enjoying μ r (G) = μ(G). In particular, we characterize unicyclic bipartite graphs having only uniquely restricted maximum matchings. Finally, we present some polynomial time algorithms recognizing unicyclic bipartite graphs with (only) uniquely restricted maximum matchings.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Chaty G., Chein M.: Ordered matchings and matchings without alternating cycles in bipartite graphs. Util. Math. 16, 183–187 (1979)

    MathSciNet  MATH  Google Scholar 

  2. Goddard W., Hedetniemi S.M., Hedetniemi S.T., Laskar R.: Generalized subgraph-restricted matchings in graphs. Discret. Math. 293, 129–138 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  3. Golumbic M.C., Hirst T., Lewenstein M.: Uniquely restricted matchings. Algorithmica 31, 139–154 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  4. Hershkowitz D., Schneider H.: Ranks of zero patterns and sign patterns. Linear Multilinear Algebra 34, 3–19 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  5. Itai A., Rodeh M., Tanimoto S.L.: Some matching problems for bipartite graphs. J. Assoc. Comput. Mach. 25, 517–525 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  6. Korte B., Lovász L., Schrader R.: Greedoids. Springer-Verlag, Berlin (1991)

    Book  MATH  Google Scholar 

  7. Krogdahl S.: The dependence graph for bases in matroids. Discret. Math. 19, 47–59 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  8. Levit, V.E., Mandrescu, E.: Unicycle bipartite graphs with only uniquely restricted maximum matchings. In: Calude, C.S., Dinneen, M.J., Sburlan S. (eds.) Proceedings of the Third International Conference on Combinatorics, Computability and Logic, (DMTCS’1), Springer, pp. 151–158 (2001)

  9. Levit V.E., Mandrescu E.: A new greedoid: the family of local maximum stable sets of a forest. Discret. Appl. Math. 124, 91–101 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  10. Levit V.E., Mandrescu E.: Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings. Discret. Appl. Math. 132, 163–174 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  11. Levit V.E., Mandrescu E.: Unicycle graphs and uniquely restricted maximum matchings. Electron. Notes Discret. Math. 22, 261–265 (2005)

    Article  Google Scholar 

  12. Levit V.E., Mandrescu E.: Greedoids on vertex sets of unicycle graphs. Congr. Numerantium 197, 183–191 (2009)

    MathSciNet  MATH  Google Scholar 

  13. Lozin V.V., Gerber M.U.: On the jump number problem in hereditary classes of bipartite graphs. Order 17, 377–385 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  14. Müller H.: Alternating cycle-free matchings. Order 7, 11–21 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  15. Nemhauser G.L., Trotter L.E. Jr: Vertex packings: structural properties and algorithms. Math. Program. 8, 232–248 (1975)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Mathematics, Ariel University Center of Samaria, Ariel, Israel

    Vadim E. Levit

  2. Department of Computer Science, Holon Institute of Technology, Holon, Israel

    Eugen Mandrescu

Authors
  1. Vadim E. Levit
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Eugen Mandrescu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Vadim E. Levit.

Additional information

A preliminary version of this paper was presented at 7th International Colloquium on Graph Theory, ICGT ’05, Hyères, France; an extended abstract has been published in [11].

Rights and permissions

Reprints and permissions

About this article

Cite this article

Levit, V.E., Mandrescu, E. On Unicyclic Graphs with Uniquely Restricted Maximum Matchings. Graphs and Combinatorics 29, 1867–1879 (2013). https://doi.org/10.1007/s00373-012-1230-7

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-012-1230-7

Keywords

Search

Navigation