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.
    [edit]

    Statements

    [edit]
    [edit]
    [edit]
    [edit]
    [edit]