Critical sets in bipartite graphs

DOI10.1007/s00026-013-0195-4zbMath1272.05151arXiv1102.1138OpenAlexW1670478499MaRDI QIDQ368442

Eugen Mandrescu, Vadim E. Levit

Publication date: 23 September 2013

Published in: Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1102.1138

zbMATH Keywords

matchingindependent setcritical set

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (6)

Critical independent sets of König-Egerváry graphs ⋮ Critical and maximum independent sets of a graph ⋮ Problems on matchings and independent sets of a graph ⋮ On the intersection of all critical sets of a unicyclic graph ⋮ Monotonic properties of collections of maximum independent sets of a graph ⋮ Regular graphs with equal matching number and independence number

Cites Work

• Unnamed Item
• A characterization of the graphs in which the transversal number equals the matching number
• Graphs and matching theorems
• Independence numbers of graphs - an extension of the Koenig-Egervary theorem
• Combinatorial properties of the family of maximum stable sets of a graph
• Critical independent sets and König-Egerváry graphs
• Vertices Belonging to All Critical Sets of a Graph
• Finding Critical Independent Sets and Critical Vertex Subsets are Polynomial Problems

This page was built for publication: Critical sets in bipartite graphs