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

Ephraim Korach; Thành Nguyen; Britta Peis

doi:10.1145/1109557.1109650

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

Ephraim Korach, Thành Nguyen, Britta Peis

Department of Industrial Engineering and Management

Research output: Contribution to conference › Paper › peer-review

33 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 language	English
Pages	842-850
Number of pages	9
DOIs	https://doi.org/10.1145/1109557.1109650
State	Published - 28 Feb 2006
Event	Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms - Miami, FL, United States Duration: 22 Jan 2006 → 24 Jan 2006

Conference

Conference	Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms
Country/Territory	United States
City	Miami, FL
Period	22/01/06 → 24/01/06

ASJC Scopus subject areas

Software
General Mathematics

Access to Document

10.1145/1109557.1109650

Cite this

@conference{68d8a21113f847b4a21567c243b6a837,

title = "Subgraph characterization of Red/Blue-split graph and konig egerv{\'a}ry graphs",

abstract = "Konig-Egerv{\'a}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{\'a}sz, and F{\"o}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.",

author = "Ephraim Korach and Th{\`a}nh Nguyen and Britta Peis",

year = "2006",

month = feb,

day = "28",

doi = "10.1145/1109557.1109650",

language = "English",

pages = "842--850",

note = "Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms ; Conference date: 22-01-2006 Through 24-01-2006",

}

TY - CONF

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

AU - Korach, Ephraim

AU - Nguyen, Thành

AU - Peis, Britta

PY - 2006/2/28

Y1 - 2006/2/28

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

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

UR - https://www.scopus.com/pages/publications/33244459401

U2 - 10.1145/1109557.1109650

DO - 10.1145/1109557.1109650

M3 - Paper

AN - SCOPUS:33244459401

SP - 842

EP - 850

T2 - Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms

Y2 - 22 January 2006 through 24 January 2006

ER -

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

Abstract

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this