Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

Browse Dictionary Books Food Places Asteroids Search

© 2026 Vinony · Knowledge from Wikipedia, Wikidata, and 27 public APIs.

crossing number · Vinony

🌐English

English Deutsch Español Français Português Русский 中文日本語

EntityQ266775· pop 8· linked from 69 articles

crossing number

Also known as cr(G)

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

Available in 8 languages

Español
Français
中文
Русский
Hungarian
Slovak
Ukrainian

via Wikidata sitelinks · CC0

Connections

On-Line Encyclopedia of Integer Sequences

Categories

Geometric intersection Graph drawing Graph invariants NP-complete problems Topological graph theory

Sources

wikipedia.externallinksexternallink

World War II

Concept

International Standard Book Number

digital object identifier

International Standard Serial Number

proportionality

distributed computing

Sign in to save

Similar entities

Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).

Entitydist 0.41

Entitydist 0.50

swingnose crossing

Entitydist 0.57

Entitydist 0.58

Entitydist 0.58

Ramsey's theorem

Entitydist 0.58

festival of the Crosses

Entitydist 0.60

Entitydist 0.60

Entitydist 0.60

Entitydist 0.61

pedestrian crossing

Entitydist 0.62

Entitydist 0.62

What links here69 pages

Courcelle's theorem

graph structure theorem

Barnette's conjecture

Szemerédi–Trotter theorem

linkless embedding

Kazimierz Zarankiewicz

outerplanar graph

Colin de Verdière graph invariant