KnowraGraph embeddingLinked fromLinked fromThe 7 pages that link to Graph embedding, each with the reason it gives.All 7Related 5Narrower topic 1Compared with 1Planar graphRelated: Planarity asks whether some embedding on the plane avoids crossings.Euler's polyhedron formulaRelated: The formula concerns how a polyhedral graph divides its surface into regions.Wagner's theoremRelated: Planarity means an embedding exists on the plane, the property the theorem characterizes.Heawood conjectureRelated: Embeddability on a surface determines which graphs enter the bound.Graph structure theoremRelated: Near-embeddability measures how closely a piece follows an embedding on a surface.