🌐EnglishEnglishDeutschРусскийفارسی中文EntityQ4545823· pop 7· linked from 42 articles1-planar graphgraph that can be drawn in the Euclidean plane in such a way that each edge has at most one crossing point with a single additional edgeWikidata factsImage3-crossing Heawood graph.svgSources (2)wikidata.orgdocs.openalex.orgvia Wikidata · CC0Available in 6 languagesРусскийHungarianSerbianUkrainianفارسیvia Wikidata sitelinks · CC0Connectionsgraph coloringEntitytime complexityEntityCategoriesNP-complete problemsPlanar graphs