On unicyclic graphs with uniquely restricted maximum matchings

DOI10.1007/S00373-012-1230-7zbMATH Open1285.05148OpenAlexW2025531703MaRDI QIDQ2637732FDOQ2637732

Authors: 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

Recommendations

• scientific article; zbMATH DE number 1665451
• Uniquely restricted matchings in interval graphs
• Unicycle graphs and uniquely restricted maximum matchings
• Graphs in which some and every maximum matching is uniquely restricted
• Uniquely restricted matchings

zbMATH Keywords

bipartite graphunicyclic graphlocal maximum stable setuniquely restricted maximum matching

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) 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
• Generalized subgraph-restricted matchings in graphs
• A new greedoid: The family of local maximum stable sets of a forest
• Title not available (Why is that?)
• Greedoids
• Greedoids on Vertex Sets of Unicycle Graphs
• Two-Commodity Flow
• Title not available (Why is that?)
• Alternating cycle-free matchings
• On the jump number problem in hereditary classes of bipartite graphs
• Unicycle graphs and uniquely restricted maximum matchings

Cited In (10)

• Uniquely restricted matchings in subcubic graphs without short cycles
• Unicycle graphs and uniquely restricted maximum matchings
• Title not available (Why is that?)
• Graphs in which some and every maximum matching is uniquely restricted
• Uniquely restricted matchings
• Computing unique maximum matchings in \(O(m)\) time for König-Egerváry graphs and unicyclic graphs
• Uniquely restricted matchings and edge colorings
• Maximizing the least Q-eigenvalue of a unicyclic graph with perfect matchings
• On the complexity of minimum maximal uniquely restricted matching
• Approximating maximum uniquely restricted matchings in bipartite graphs

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

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