Laminar tight cuts in matching covered graphs (Q2040018): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 2003.08622 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a conjecture of Lovász concerning bricks. II: Bricks of finite characteristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: On tight cuts in matching covered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Brick decompositions and the matching rank of 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: Q3395507 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect matchings versus odd cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Factorization of Linear Graphs / rank
 
Normal rank

Latest revision as of 03:14, 26 July 2024

scientific article
Language Label Description Also known as
English
Laminar tight cuts in matching covered graphs
scientific article

    Statements

    Laminar tight cuts in matching covered graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    6 July 2021
    0 references
    tight cut
    0 references
    ELP-cut
    0 references
    perfect matching
    0 references
    matching covered graph
    0 references

    Identifiers