Q266775

From Wikidata
Jump to: navigation, search

Crossing number(Q266775)

the smallest number of edge crossings possible in a drawing of a node-link graph
    No aliases defined.
[edit]
Language Label Description Also known as
English
Crossing number
the smallest number of edge crossings possible in a drawing of a node-link graph

    Statements

    /m/04cx07j
    1 reference
    [edit]
    [edit]
    [edit]
    [edit]
    [edit]
    [edit]