Planar graph - Wikipedia
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. [1] [2] Such a drawing is called a plane graph, or a planar embedding of the graph.
可平面图 - 百度百科
可平面图(planar graph)是一类特殊的图，指同构于某一平面图的图。 如果一个图能够画在平面上，使得顶点集合及边集合分别是相同的，而如果边相交仅在边的端点处，则称这个图是可嵌入平面的，或称作可平面图(planar graph)；否则称作不可平面图，可平面图G的 ...
平面图 (图论) - 维基百科，自由的百科全书
2024年11月17日 · 平面图分离定理 （ 英语 ： planar separator theorem ） 说给定任何包含 n 个顶点的平面图，都可以借由移除至多 () 个点来将原图分开成两个部分，并且各部分的顶点数不超过 个。
图形演算和向上平面性 I - 知乎 - 知乎专栏
向上平面画法（upward planar drawing）是 定向图 的一种平面画法，其特殊性在于要求每条定向边都是从下往上画的(或朝向任意一个固定方向)，例见下图。 正如 平面性 是指平面画法的存在性， 向上平面性 则是指向上平面画法的存在性。
A graph is called planar if it can be drawn in the plane (R 2) with vertex v drawn as a point f(v) 2 R2, and edge (u; v) drawn as a continuous curve between f(u) and f(v), such that no two edges intersect (except possibly at the end-points).
Such a drawing of G in S is called an embedding of G in S, denoted by. If a graph G is embeddable on the plane (or the sphere), G is called a planar graph; otherwise G is called a non-planar...
Planar Graphs - openmathbooks.github.io
When a connected graph can be drawn without any edges crossing, it is called planar. When a planar graph is drawn in this way, it divides the plane into regions called faces. Draw, if possible, two different planar graphs with the same number of vertices, edges, and faces.
Planar graphs are graphs that can be drawn in the plane —like familiar maps of countries or states. “Drawing” the graph means that each vertex of the graph corresponds to a distinct point in the plane, and if two vertices are adjacent, their vertices are connected by a smooth, non-self-intersecting curve.
A graph G is said to be planar if it is possible to draw it in such a way that the edges intersect only at their end points (the vertices). Such a drawing is also called a planar diagram for G or a planar embedding of G. Indeed, it is possible to think of such a drawing—call it G˜—as a graph isomorphic to G. Recall our original definition
Planar Graphs and Plane Drawings - Mathonline - Wikidot
Planar Graphs and Plane Drawings Definition: A graph is considered Planar if it can be redrawn such that no edges intersect. That is, a graph is planar if there exists a plane drawing of the graph.