Skip to content
EntityQ266775· pop 8· linked from 69 articles

crossing number

Sign in to save

Also known as cr(G)

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

Described at

Link to a page describing this subject · not written by Vinony

Wikidata facts

Instance of
graph property
Show 3 more facts
Sources (2)

via Wikidata · CC0

Available in 8 languages

via Wikidata sitelinks · CC0