Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Planar graph
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==See also== * [[Combinatorial map]] a combinatorial object that can encode plane graphs * [[Planarization]], a planar graph formed from a drawing with crossings by replacing each crossing point by a new vertex * [[Thickness (graph theory)]], the smallest number of planar graphs into which the edges of a given graph may be partitioned * [[Planarity]], a puzzle computer game in which the objective is to embed a planar graph onto a plane * [[Sprouts (game)]], a pencil-and-paper game where a planar graph subject to certain constraints is constructed as part of the game play * [[Three utilities problem]], a popular puzzle
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)