Q266775

From Wikidata
Jump to: navigation, search

Crossing number (Q266775) [edit]

the smallest number of edge crossings possible in a drawing of a node-link graph [edit]

No aliases defined.
    [add]

    Statements

    /m/04cx07j
    [edit]
    1 reference
    [add]
    Language Code Linked page
    English enwiki
    español eswiki
    magyar huwiki
    slovenčina skwiki
    中文 zhwiki
    [add]
    [add]
    [add]
    [add]
    [add]
    [add]