A min-max theorem for plane bipartite graphs (Q968154): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Unimodularity of the Clar number problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3840360 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4511016 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3813828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5753988 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3236252 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A min-max result on catacondensed benzenoid graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic Characterizations of Unimodular Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A min-max result on outerplane bipartite graphs / rank
 
Normal rank

Revision as of 18:42, 2 July 2024

scientific article
Language Label Description Also known as
English
A min-max theorem for plane bipartite graphs
scientific article

    Statements

    A min-max theorem for plane bipartite graphs (English)
    0 references
    0 references
    0 references
    5 May 2010
    0 references
    plane bipartite graphs
    0 references
    clar number
    0 references
    combinatorial dual
    0 references
    network flows
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references