Forbidden subgraphs and the Kőnig property (Q2840731): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
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: The computational complexity of the Edge-Perfect Graph and the Totally Balanced Packing Game recognition problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3143963 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3270978 / 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: 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: Q2920759 / 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

Revision as of 15:27, 6 July 2024

scientific article
Language Label Description Also known as
English
Forbidden subgraphs and the Kőnig property
scientific article

    Statements

    Forbidden subgraphs and the Kőnig property (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    23 July 2013
    0 references
    edge-perfect graphs
    0 references
    forbidden subgraphs
    0 references
    Kőnig property
    0 references
    Kőnig-Egerváry graphs
    0 references
    maximum matching
    0 references

    Identifiers