Graph of a function | graph | Bipartite graph | planar graph | graph theory | directed graph | Under Graph | random graph | Planar lamina | Planar graph | Graph traversal | Graph theory | Graph (mathematics) | Gabriel graph | visibility graph | Unit distance graph | rook's graph | Rado graph | Planar Systems | Planar separator theorem | minor (graph theory) | Maximal-ratio combining | Lattice graph | interval graph | Graph-tool | Graph (data structure) | Graph coloring | graph coloring | Graph | Factor graph |
For maximal planar graphs, in which every face is a triangle, a greedy planar embedding can be found by applying the Knaster–Kuratowski–Mazurkiewicz lemma to a weighted version of a straight-line embedding algorithm of Schnyder.