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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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

Latest revision as of 20:40, 22 July 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