Equivalence classes in matching covered graphs (Q2185935): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disc.2020.111945 / rank
Normal rank
 
Property / author
 
Property / author: Lian Zhu Zhang / rank
Normal rank
 
Property / author
 
Property / author: Lian Zhu Zhang / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3022029076 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1902.09260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ear decompositions of matching covered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a conjecture of Lovász concerning bricks. I: The characteristic of a matching covered graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On perfect matchings in matching covered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching structure and the matching lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Two Unsolved Problems Concerning Matching Covered Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On n-extendable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3800093 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DISC.2020.111945 / rank
 
Normal rank

Latest revision as of 09:49, 17 December 2024

scientific article
Language Label Description Also known as
English
Equivalence classes in matching covered graphs
scientific article

    Statements

    Equivalence classes in matching covered graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    8 June 2020
    0 references
    equivalence classes
    0 references
    perfect matchings
    0 references
    matching covered graphs
    0 references
    tight cuts
    0 references
    separating cuts
    0 references
    bricks
    0 references

    Identifiers