The complexity of two graph orientation problems (Q412352)

From MaRDI portal
Revision as of 03:03, 5 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The complexity of two graph orientation problems
scientific article

    Statements

    title
    The complexity of two graph orientation problems (English)
    0 references
    author
    Nicole Eggemann
    0 references
    Steven D. Noble
    0 references
    publication date
    4 May 2012
    0 references
    zbMATH Keywords
    graph orientation
    0 references
    diameter
    0 references
    planar graph
    0 references
    graph minors
    0 references
    apex graph
    0 references
    cites work
    Digraphs
    0 references
    Q4291429
    0 references
    Q4385531
    0 references
    Q3077955
    0 references
    Graph minor theory
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C38
    0 references
    05C83
    0 references
    05C85
    0 references
    05C12
    0 references
    zbMATH DE Number
    6030389
    0 references
    OpenAlex ID
    W2112534214
    0 references
    arXiv ID
    1004.2478
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q412352&oldid=35275759"
    Powered by MediaWiki