Planar
Summary
A planar graph is a graph that has an embedding onto the Euclidean plane. A plane graph is a planar graph for which a particular embedding has already been fixed. A -planar graph is one that can be drawn in the plane with at most crossings per edge.
Further reading
- Wikipedia, page 325802, revision 1373839425, Glossary of graph theory, section P. adopted
About this page
| Tag | V908WBQ72T |
|---|---|
| URI | m2://V908WBQ72T |
| Kind | concept |
| Writing | W1 stated |
| Changed | 4 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge defines in: at least one definition (0 of 1)
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
- edge specializes both: the more general notions and the special cases (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.