A kuratowski-type theorem for planarity of partially embedded graphs

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Vít Jelínek Faculty of Mathematics, University of Vienna, Vienna, Austria
Jan Kratochvíl Charles University, Prague, Czech Rep
Ignaz Rutter Institute of Theoretical Informatics, Karlsruhe Institute of Technology, Karlsruhe, Germany
Published in:
Cover Image
 
· Proceeding
SoCG '11 Proceedings of the 27th annual ACM symposium on Computational geometry
Pages 107-116
ACM New York, NY, USA ©2011
table of contents ISBN: 978-1-4503-0682-9 doi>10.1145/1998196.1998214
A kuratowski-type theorem for planarity of partially embedded graphs Published by ACM 2011 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 20
· Downloads (cumulative): 68
· Citation Count: 1


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder