Bicritical graphs without removable edges (Q2166208): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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: 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: On a Family of Planar Bicritical Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal bricks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Factorization of Linear Graphs / rank
 
Normal rank

Latest revision as of 23:25, 29 July 2024

scientific article
Language Label Description Also known as
English
Bicritical graphs without removable edges
scientific article

    Statements

    Bicritical graphs without removable edges (English)
    0 references
    0 references
    0 references
    0 references
    24 August 2022
    0 references
    0 references
    bicritical graph
    0 references
    removable edge
    0 references
    2-vertex cut
    0 references
    claw-free graph
    0 references
    0 references