On unicyclic graphs with uniquely restricted maximum matchings

DOI10.1007/s00373-012-1230-7zbMath1285.05148OpenAlexW2025531703MaRDI QIDQ2637732

Vadim E. Levit, Eugen Mandrescu

Publication date: 14 February 2014

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-012-1230-7

zbMATH Keywords

bipartite graphunicyclic graphlocal maximum stable setuniquely restricted maximum 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) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• Greedoids
• The dependence graph for bases in matroids
• Alternating cycle-free matchings
• Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings
• Generalized subgraph-restricted matchings in graphs
• A new greedoid: The family of local maximum stable sets of a forest
• Unicycle graphs and uniquely restricted maximum matchings
• Greedoids on Vertex Sets of Unicycle Graphs
• Vertex packings: Structural properties and algorithms
• Two-Commodity Flow
• Ranks of zero patterns and sign patterns^*
• On the jump number problem in hereditary classes of bipartite graphs
• Uniquely restricted matchings

This page was built for publication: On unicyclic graphs with uniquely restricted maximum matchings