Minmax relations for cyclically ordered digraphs (Q885290)

From MaRDI portal
Revision as of 18:51, 6 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Minmax relations for cyclically ordered digraphs
scientific article

    Statements

    title
    Minmax relations for cyclically ordered digraphs (English)
    0 references
    author
    András Sebő
    0 references
    publication date
    8 June 2007
    0 references
    Mathematics Subject Classification ID
    05C20
    0 references
    05C15
    0 references
    05C70
    0 references
    zbMATH DE Number
    5162675
    0 references
    zbMATH Keywords
    stable set
    0 references
    coloring
    0 references
    orders
    0 references
    covering
    0 references
    packing
    0 references
    polyhedron
    0 references
    network flow
    0 references
    minimum cost flow
    0 references
     
      Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q885290&oldid=1158584"
      Powered by MediaWiki