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

Vadim E. Levit; Eugen Mandrescu

doi:10.1016/j.dam.2013.01.005

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

Vadim E. Levit
, Eugen Mandrescu

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

24 Scopus citations

Abstract

For a graph G let α(G),μ(G), and τ(G) denote its independence number, matching number, and vertex cover number, respectively. If α(G)+μ(G)=|V(G)| or, equivalently, μ(G)=τ(G), then G is a König-Egerváry graph. In this paper we give a new characterization of König-Egerváry graphs.

Original language	English
Pages (from-to)	1635-1638
Number of pages	4
Journal	Discrete Applied Mathematics
Volume	161
Issue number	10-11
DOIs	https://doi.org/10.1016/j.dam.2013.01.005
State	Published - Jul 2013

Keywords

Maximum independent set
Maximum matching

Access to Document

10.1016/j.dam.2013.01.005

Cite this

@article{a5b8b3df27464e07ac29f4b3fad306d8,

title = "On maximum matchings in K{\"o}nig-Egerv{\'a}ry graphs",

abstract = "For a graph G let α(G),μ(G), and τ(G) denote its independence number, matching number, and vertex cover number, respectively. If α(G)+μ(G)=|V(G)| or, equivalently, μ(G)=τ(G), then G is a K{\"o}nig-Egerv{\'a}ry graph. In this paper we give a new characterization of K{\"o}nig-Egerv{\'a}ry graphs.",

keywords = "Maximum independent set, Maximum matching",

author = "Levit, \{Vadim E.\} and Eugen Mandrescu",

year = "2013",

month = jul,

doi = "10.1016/j.dam.2013.01.005",

language = "אנגלית",

volume = "161",

pages = "1635--1638",

journal = "Discrete Applied Mathematics",

issn = "0166-218X",

publisher = "Elsevier B.V.",

number = "10-11",

}

TY - JOUR

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

AU - Levit, Vadim E.

AU - Mandrescu, Eugen

PY - 2013/7

Y1 - 2013/7

N2 - For a graph G let α(G),μ(G), and τ(G) denote its independence number, matching number, and vertex cover number, respectively. If α(G)+μ(G)=|V(G)| or, equivalently, μ(G)=τ(G), then G is a König-Egerváry graph. In this paper we give a new characterization of König-Egerváry graphs.

AB - For a graph G let α(G),μ(G), and τ(G) denote its independence number, matching number, and vertex cover number, respectively. If α(G)+μ(G)=|V(G)| or, equivalently, μ(G)=τ(G), then G is a König-Egerváry graph. In this paper we give a new characterization of König-Egerváry graphs.

KW - Maximum independent set

KW - Maximum matching

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

U2 - 10.1016/j.dam.2013.01.005

DO - 10.1016/j.dam.2013.01.005

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:84876415169

SN - 0166-218X

VL - 161

SP - 1635

EP - 1638

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

IS - 10-11

ER -

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

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this