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!
==References== *{{citation|first=Kazimierz|last=Kuratowski|author-link=Kazimierz Kuratowski|year=1930|url=http://matwbn.icm.edu.pl/ksiazki/fm/fm15/fm15126.pdf|title=Sur le problème des courbes gauches en topologie|language=fr|journal=Fundamenta Mathematicae|volume=15|pages=271–283|doi=10.4064/fm-15-1-271-283|doi-access=free}}. *{{citation|first=K.|last=Wagner|year=1937|title=Über eine Eigenschaft der ebenen Komplexe|language=de|journal=Mathematische Annalen|volume=114|pages=570–590|doi=10.1007/BF01594196|s2cid=123534907}}. *{{citation|first1=John M.|last1=Boyer|first2=Wendy J.|last2=Myrvold|author2-link= Wendy Myrvold |year=2005|url=http://jgaa.info/accepted/2004/BoyerMyrvold2004.8.3.pdf|title=On the cutting edge: Simplified O(n) planarity by edge addition|journal=[[Journal of Graph Algorithms and Applications]]|volume=8|issue=3|pages=241–273|doi=10.7155/jgaa.00091|doi-access=free}}. *{{citation|first1=Brendan|last1=McKay|author-link1=Brendan McKay (mathematician)|first2=Gunnar|last2=Brinkmann|url=http://cs.anu.edu.au/~bdm/plantri/|title=A useful planar graph generator}}. *{{citation|first1=H.|last1=de Fraysseix|first2=P.|last2=Ossona de Mendez|author2-link = Patrice Ossona de Mendez |first3=P.|last3=Rosenstiehl|year=2006|title=Trémaux trees and planarity|journal=International Journal of Foundations of Computer Science|volume=17|issue=5|pages=1017–1029|doi=10.1142/S0129054106004248|arxiv=math/0610935|s2cid=40107560}}. Special Issue on Graph Drawing. *{{cite tech report |author1-link=David Bader (computer scientist)|first1=D.A. |last1=Bader |first2=S. |last2=Sreshta |url=http://www.cc.gatech.edu/~bader/papers/planarity2003.html |archive-url=https://web.archive.org/web/20160316171835/http://www.cc.gatech.edu/~bader/papers/planarity2003.html |archive-date=2016-03-16 |title=A New Parallel Algorithm for Planarity Testing |id=UNM-ECE Technical Report 03-002 |date=October 1, 2003}} *{{citation|first=Steve|last=Fisk|year=1978|title=A short proof of Chvátal's watchman theorem|journal=Journal of Combinatorial Theory, Series B|volume=24|pages=374|doi=10.1016/0095-8956(78)90059-X|issue=3|doi-access=}}.
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)