Metraipolis › archive › dc_0ce032ecedc7

Planar graph — Wikipedia (en)

Source: Wikipedia (en)
Original: https://en.wikipedia.org/wiki/Planar_graph
License (as archived): CC-BY-SA-4.0
Archived: 2026-10-06T12:51:35.670Z
SHA-256 of the archived text: 7177f6645b4c228211c4336fe1de768ba67e4f3e8ba8b2c5df1f336c9007dbc8
Stable URL of this page: https://metraipolis.com/documento/dc_0ce032ecedc7

How to cite

Planar graph — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Planar_graph (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_0ce032ecedc7 (Metraipolis archive dc_0ce032ecedc7, sha256 7177f6645b4c228211c4336fe1de768ba67e4f3e8ba8b2c5df1f336c9007dbc8)

BibTeX

@misc{dc0ce032ecedc7,
  title = {Planar graph — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Planar_graph},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_0ce032ecedc7; sha256 7177f6645b4c228211c4336fe1de768ba67e4f3e8ba8b2c5df1f336c9007dbc8},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Planar_graph. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In graph theory, a planar graph is a graph that can be embedded in the plane, i.e., it can be drawn on the plane in such a way that its edges intersect only at their endpoints. In other words, it can be drawn in such a way that no edges cross each other. Such a drawing is called a plane graph, or a planar embedding of the graph. A plane graph can be defined as a planar graph with a mapping from every node to a point on a plane, and from every edge to a plane curve on that plane, such that the extreme points of each curve are the points mapped from its end nodes, and all curves are disjoint except on their extreme points. Every graph that can be drawn on a plane can be drawn on the sphere as well, and vice versa, by means of stereographic projection. Plane graphs can be encoded with combinatorial maps or rotation systems. An equivalence class of topologically equivalent drawings on the sphere, usually with additional assumptions such as connectedness, is called a planar map. Although a plane graph has an external or unbounded face, none of the faces of a planar map has a particular status. Planar graphs generalize to graphs drawable on a surface of a given genus. In this terminology, planar graphs have genus 0, since the plane (and the sphere) are surfaces of genus 0. See "graph embedding" for other related topics.

Tema degli esploratori: matematica e informatica teorica (deposito sistematico; ricerca «graph theory»).
Fonte: Wikipedia in inglese, voce «Planar graph» — https://en.wikipedia.org/wiki/Planar_graph
Wikidata Q547823: «grafo raffigurabile su un piano senza alcun incrocio tra gli archi» (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q547823
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Planar_graph?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1369972096, consultata il 2026-10-06T11:07:58.641Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: fde5410a3df027985ea6590c9b96d9e8ecd5d183fd189ed0dbe3fadff11eab33