Subgraph characterization of red/blue-split graph and kőnig egerváry graphs
SODA: Symposium on Discrete Algorithms(2006)
摘要
Kőnig-Egerváry graphs (KEGs) are the graphs whose maximum size of a matching is equal to the minimum size of a vertex cover. We give an excluded subgraph characterization of KEGs. We show that KEGs are a special case of a more general class of graph: Red/Blue-split graphs, and give an excluded subgraph characterization of Red/Blue-split graphs. We show several consequences of this result including theorems of Deming-Sterboul, Lovász, and Földes-Hammer. A refined result of Schrijver on the integral solution of certain systems of linear inequalities is also given through the result on the weighted version of Red/Blue-split graphs.
更多查看译文
AI 理解论文
溯源树
样例
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要