Subgraph characterization of Red/Blue-split graph and konig egerváry graphs

Ephraim Korach, Thành Nguyen, Britta Peis

Research output: Contribution to conferencePaperpeer-review

31 Scopus citations

Abstract

Konig-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.

Original languageEnglish
Pages842-850
Number of pages9
DOIs
StatePublished - 28 Feb 2006
EventSeventeenth Annual ACM-SIAM Symposium on Discrete Algorithms - Miami, FL, United States
Duration: 22 Jan 200624 Jan 2006

Conference

ConferenceSeventeenth Annual ACM-SIAM Symposium on Discrete Algorithms
Country/TerritoryUnited States
CityMiami, FL
Period22/01/0624/01/06

ASJC Scopus subject areas

  • Software
  • Mathematics (all)

Fingerprint

Dive into the research topics of 'Subgraph characterization of Red/Blue-split graph and konig egerváry graphs'. Together they form a unique fingerprint.

Cite this