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

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.

Saved in:
Bibliographic Details
Published inDiscrete Applied Mathematics Vol. 161; no. 10-11; pp. 1635 - 1638
Main Authors Levit, Vadim E., Mandrescu, Eugen
Format Journal Article
LanguageEnglish
Published Elsevier B.V 01.07.2013
Subjects
Equivalence
Graphs
Matching
Mathematical analysis
Maximum independent set
Maximum matching
Maximum independent set
Maximum matching
Online AccessGet full text

Cover

More Information
Summary: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.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0166-218X
1872-6771
DOI:10.1016/j.dam.2013.01.005