Crowns in bipartite graphs

DOI10.1016/j.endm.2016.09.009zbMath1356.05111OpenAlexW2534821370MaRDI QIDQ510531

Eugen Mandrescu, Vadim E. Levit

Publication date: 13 February 2017

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

zbMATH Keywords

bipartite graphmaximum matchingcrownKönig-Egerváry graphlocal maximum stable setorder of a crown

Mathematics Subject Classification ID

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

Related Items (2)

Critical sets, crowns and local maximum independent sets ⋮ Kernels for packing and covering problems

Cites Work

• Unnamed Item
• Unnamed Item
• Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings
• Very well covered graphs
• A new greedoid: The family of local maximum stable sets of a forest
• On maximum matchings in König-Egerváry graphs
• Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids
• Crown structures for vertex cover kernelization
• Extension of the Nemhauser and Trotter Theorem to Generalized Vertex Cover with Applications
• Vertex packings: Structural properties and algorithms
• Some covering concepts in graphs
• Uniquely restricted matchings

This page was built for publication: Crowns in bipartite graphs