Planar Graph
429
浏览
0
关注

In graph theory, a planar graph is a graph (mathematics)|graph that can be graph embedding|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 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.Plane graphs can be encoded by combinatorial maps. The equivalence class of topologically equivalent drawings on the sphere is called a planar map. Although a plane graph has an external or unbounded face, none of the faces of a planar map have a...
[展开]
相关概念
Lower Bound    
Plane Graph    
Upper Bound    
主要的会议/期刊
演化趋势
Chart will load here
Planar Graph文章数量变化趋势

Feedback
Feedback
Feedback
我想反馈:
排行榜