Perfect Matchings Avoiding Several Independent Edges in a Star-Free Graph (Q2811193): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On matching extensions with prescribed and proscribed edge sets. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matchings and matching extensions in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect matchings avoiding prescribed edges in a star-free graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A pair of forbidden subgraphs and perfect matchings in graphs of high connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A pair of forbidden subgraphs and perfect matchings. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidden triples for perfect matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidden induced subgraphs for perfect matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidden subgraphs and bounds on the size of a maximum matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4876750 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 1-Factors and Antifactor Sets / rank
 
Normal rank

Latest revision as of 02:55, 12 July 2024

scientific article
Language Label Description Also known as
English
Perfect Matchings Avoiding Several Independent Edges in a Star-Free Graph
scientific article

    Statements

    Identifiers