Forbidden subgraphs and the Kőnig property

DOI10.1016/j.endm.2011.05.057zbMath1268.05156OpenAlexW2029220811MaRDI QIDQ2840731

Mitre C. Dourado, Luciano N. Grippo, Martín D. Safe, Guillermo Durán, Luérbio Faria

Publication date: 23 July 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

maximum matchingforbidden subgraphsedge-perfect graphsKőnig propertyKőnig-Egerváry graphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

On maximum matchings in König-Egerváry graphs

Cites Work

• A characterization of the graphs in which the transversal number equals the matching number
• Ear-decompositions of matching-covered graphs
• Matching theory
• Independence numbers of graphs - an extension of the Koenig-Egervary theorem
• The computational complexity of the Edge-Perfect Graph and the Totally Balanced Packing Game recognition problems
• Subgraph characterization of red/blue-split graph and kőnig egerváry graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item