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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.jctb.2021.05.003 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W3166985861 / rank
 
Normal rank
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
Property / DOI
 
Property / DOI: 10.1016/J.JCTB.2021.05.003 / rank
 
Normal rank

Latest revision as of 20:45, 16 December 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