Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings
DOI10.1016/S0166-218X(03)00398-6zbMATH Open1028.05089OpenAlexW1990446008MaRDI QIDQ1414591FDOQ1414591
Authors: Vadim E. Levit, Eugen Mandrescu 
Publication date: 4 December 2003
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(03)00398-6
Recommendations
- On the set of stable matchings in a bipartite graph
- Maximum locally stable matchings
- On the maximum uniquely restricted matching for bipartite graphs
- On duality between local maximum stable sets of a graph and its line-graph
- Local maximum stable set greedoids stemming from very well-covered graphs
- Maximum stable sets in analogs of Kneser and complete graphs
- Approximating maximum uniquely restricted matchings in bipartite graphs
- On the stable \(b\)-matching problem in multigraphs
- Perfect matchings in graphs with prescribed local restrictions
- Graphs in which some and every maximum matching is uniquely restricted
Bipartite graphMaximum matchingGreedoidLocal maximum stable setMaximum stable setUniquely restricted matching
Trees (05C05) Distance in graphs (05C12) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)
Cites Work
- Introduction to Greedoids
- Vertex packings: Structural properties and algorithms
- Ranks of zero patterns and sign patterns*
- Some Matching Problems for Bipartite Graphs
- The dependence graph for bases in matroids
- Uniquely restricted matchings
- A new greedoid: The family of local maximum stable sets of a forest
- Greedoids
- Reducing the adjacency matrix of a tree
- Title not available (Why is that?)
- Alternating cycle-free matchings
- On the jump number problem in hereditary classes of bipartite graphs
Cited In (17)
- Unicycle graphs and uniquely restricted maximum matchings
- On duality between local maximum stable sets of a graph and its line-graph
- Title not available (Why is that?)
- The Clique Corona Operation and Greedoids
- On local maximum stable set greedoids
- Critical sets, crowns and local maximum independent sets
- On the hardness of deciding the equality of the induced and the uniquely restricted matching number
- Graph operations that are good for greedoids
- Local maximum stable set greedoids stemming from very well-covered graphs
- Zeros distribution of the reverse strong Turán expressions of polynomials sequences
- Computing unique maximum matchings in \(O(m)\) time for König-Egerváry graphs and unicyclic graphs
- Very well-covered graphs of girth at least four and local maximum stable set greedoids
- Crowns in bipartite graphs
- Approximating maximum uniquely restricted matchings in bipartite graphs
- On the equality of the induced matching number and the uniquely restricted matching number for subcubic graphs
- On unicyclic graphs with uniquely restricted maximum matchings
- Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids
This page was built for publication: Local maximum stable sets in bipartite 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 Q1414591)
