A characterization of König-Egerváry graphs with extendable vertex covers (Q783699): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: TWO THEOREMS IN GRAPH THEORY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of Konig-Egervary graphs using a common property of all maximum matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of König subgraph problems and above-guarantee vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Flowers and Vertex Cover / rank
 
Normal rank

Revision as of 05:04, 23 July 2024

scientific article
Language Label Description Also known as
English
A characterization of König-Egerváry graphs with extendable vertex covers
scientific article

    Statements

    A characterization of König-Egerváry graphs with extendable vertex covers (English)
    0 references
    0 references
    0 references
    0 references
    4 August 2020
    0 references
    graph algorithms
    0 references
    König-Egerváry graphs
    0 references
    vertex covers
    0 references
    maximum matchings
    0 references

    Identifiers