A characterization of Konig-Egervary graphs using a common property of all maximum matchings (Q2857406): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 3 users not shown)
label / enlabel / en
 
A characterization of Konig-Egervary graphs using a common property of all maximum matchings
Property / author
 
Property / author: Vadim E. Levit / rank
Normal rank
 
Property / author
 
Property / author: Eugen Mandrescu / rank
Normal rank
 
Property / author
 
Property / author: Vadim E. Levit / rank
 
Normal rank
Property / author
 
Property / author: Eugen Mandrescu / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 0911.4626 / rank
 
Normal rank
Property / arXiv classification
 
cs.DM
Property / arXiv classification: cs.DM / rank
 
Normal rank
Property / arXiv classification
 
math.CO
Property / arXiv classification: math.CO / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node-weighted graphs having the König-Egerváry property / rank
 
Normal rank
Property / cites work
 
Property / cites work: König-Egerváry graphs, 2-bicritical graphs and fractional matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5477957 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence numbers of graphs - an extension of the Koenig-Egervary theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgraph characterization of red/blue-split graph and kőnig egerváry graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The critical independence number and an independence decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4489216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial properties of the family of maximum stable sets of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(\alpha^{+}\)-stable König-Egerváry graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(\alpha\)-critical edges in König--Egerváry graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3429589 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critical independent sets and König-Egerváry graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ear-decompositions of matching-covered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of König-Egervary graphs and heuristics for the maximum independent set problem with improved approximation ratios / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of the graphs in which the transversal number equals the matching number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Critical Independent Sets and Critical Vertex Subsets are Polynomial Problems / rank
 
Normal rank

Latest revision as of 00:44, 7 July 2024

scientific article
Language Label Description Also known as
English
A characterization of Konig-Egervary graphs using a common property of all maximum matchings
scientific article

    Statements

    1 November 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    cs.DM
    0 references
    math.CO
    0 references