Planar graphs

graph that can be embedded in the plane

Archimedean solid

Platonic solid

Archimedean solid

graph representing faces of another graph

graph formed from a cycle graph by adding a new vertex adjacent to all the vertices in the cycle

3-connected simple planar graph

graph that has a planar unit distance embedding

connected graph in which any two simple cycles have at most one vertex in common

planar undirected graph with 2n vertices and 3n-2 edges; the Cartesian product of two path graphs, one of which has only one edge

graph whose embedding in a Euclidean space forms a regular tiling

graph with 5 nodes and 6 edges

algorithmic problem of testing whether a given graph is a planar graph

cubic graph with 12 vertices and 18 edges

recursively-formed graph with two terminal vertices

asymmetric cubic planar graph with 12 vertices and 18 edges

bipartite undirected graph

planar undirected graph with 2n+1 vertices and 3n edges

graph that can be drawn in the Euclidean plane in such a way that each edge has at most one crossing point with a single additional edge

matroid whose independent sets are forests in an undirected graph

graph that can be drawn without crossings in the plane with all vertices on the outer face

a type of planar graph formed from a tree by adding a cycle of edges through its leaves

representation of a given graph in computational geometry

algorithm for counting perfect matchings in planar graphs

simple undirected graph with 11 vertices and 27 edges

graph that can be made planar by the removal of a single vertex

cubic graph with 12 vertices and 18 edges

cubic graph with 46 vertices and 69 edges

minimum number of planar graphs into which the edges can be partitioned

undirected unit-distance graph requiring four colors

thumb|A squaregraph. In graph theory, a branch of mathematics, a squaregraph is a type of undirected graph that can be drawn in the plane in such a way that every bounded face is a quadrilateral and every vertex with three or fewer neighbors is incident to an unbounded face.

graph with 5 vertices and 5 edges

one of two types of graph: quadrilateral books and square books

graph with a prism as its skeleton