A characterization of complete bipartite RAC graphs (Q765516)

From MaRDI portal
Revision as of 21:25, 4 April 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q59702321, #quickstatements; #temporary_batch_1712261475387)
scientific article
Language Label Description Also known as
English
A characterization of complete bipartite RAC graphs
scientific article

    Statements

    title
    A characterization of complete bipartite RAC graphs (English)
    0 references
    author
    Walter Didimo
    0 references
    Peter Eades
    0 references
    Giuseppe Liotta
    0 references
    publication date
    19 March 2012
    0 references
    zbMATH Keywords
    computational geometry
    0 references
    combinatorial problems
    0 references
    graph algorithms
    0 references
    theory of computation
    0 references

    Identifiers

    zbMATH DE Number
    6016058
    0 references
    OpenAlex ID
    W2046203894
    0 references
    Wikidata QID
    Q59702321
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q765516&oldid=33241885"
    Powered by MediaWiki