Unicycle graphs and uniquely restricted maximum matchings

DOI10.1016/J.ENDM.2005.06.055zbMATH Open1200.05175OpenAlexW2015646807MaRDI QIDQ3439344FDOQ3439344

Authors: Vadim E. Levit, Eugen Mandrescu 

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2005.06.055

Recommendations

• On unicyclic graphs with uniquely restricted maximum matchings
• scientific article; zbMATH DE number 1665451
• Uniquely restricted matchings in subcubic graphs without short cycles
• Lower bounds on the uniquely restricted matching number
• Graphs in which some and every maximum matching is uniquely restricted

zbMATH Keywords

greedoidlocal maximum stable setuniquely restricted matching

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Vertex packings: Structural properties and algorithms
• Ranks of zero patterns and sign patterns^*
• The dependence graph for bases in matroids
• Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings
• Uniquely restricted matchings
• A new greedoid: The family of local maximum stable sets of a forest
• Greedoids
• Title not available (Why is that?)
• Alternating cycle-free matchings
• On the jump number problem in hereditary classes of bipartite graphs

Cited In (5)

• Title not available (Why is that?)
• Graphs in which some and every maximum matching is uniquely restricted
• Uniquely restricted matchings and edge colorings
• Approximating maximum uniquely restricted matchings in bipartite graphs
• On unicyclic graphs with uniquely restricted maximum matchings

This page was built for publication: Unicycle graphs and uniquely restricted maximum matchings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3439344)