format_list_bulleted
Planar graphs
more_vert
The list Planar graphs includes
Four color theorem, Planar graph and Combinatorial map.
The list consists of 3 members
and 1 sublist.
-
1.
Four color theorem
statement in mathematics
Overview: In mathematics, the four color theorem, or the four color map theorem, states that no more than four colors are required to color the regions of any map so that no two adjacent regions have the same color ...
0
0
-
2.
Planar graph
graph that can be embedded in the planeOverview: 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 ... 0
0
-
3.
Combinatorial map
combinatorial object modelling topological structures with subdivided objectsOverview: A combinatorial map is a combinatorial representation of a graph on an orientable surface. A combinatorial map may also be called a combinatorial embedding, a rotation system, an orientable ribbon graph ... 0
0
