Combinatorics Planar graphs, embeddings, minors Concept
Planar graph
Summary
A planar graph is a graph that can be drawn in the plane with no crossing edges. Planar graphs are the subject of Euler's formula and of the four colour theorem. The node planar graph gives the precise definition.
Where this leads
5 pages build on this one.
Further reading
- Web https://en.wikipedia.org/wiki/Planar_graph, lead section
About this page
| Tag | 0NC9R64TXP |
|---|---|
| URI | m2://0NC9R64TXP |
| Kind | concept |
| Writing | W1 stated |
| MSC | 05C10 |
| Specializes | Graph |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.