Untangling Polygons and Graphs-Reference-Cited by-同舟云学术

Untangling Polygons and Graphs

Published:2009-03-06 Issue:2 Volume:43 Page:402-411
ISSN:0179-5376
Container-title:Discrete & Computational Geometry
language:en
Short-container-title:Discrete Comput Geom

Author:

Cibulka Josef

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/s00454-009-9150-x.pdf

Reference11 articles.

1. Barnette, D.: Trees in polyhedral graphs. Can. J. Math. 18, 731–736 (1966)

2. Bose, P., Dujmović, V., Hurtado, F., Langerman, S., Morin, P., Wood, D.: A polynomial bound for untangling geometric planar graphs. Discrete Comput. Geom. (2008). doi: 10.1007/s00454-008-9125-3

3. Erdős, P., Szekeres, G.: A combinatorial problem in geometry. Compos. Math. 2, 463–470 (1935)

4. Fáry, I.: On straight line representation of planar graphs. Acta Univ. Szeged, Acta Sci. Math. 11, 229–233 (1948)

5. Goaoc, X., Kratochvíl, J., Okamoto, Y., Shin, C.-S., Spillner, A., Wolff, A.: Untangling a planar graph. Discrete Comput. Geom. (2009) doi: 10.1007/s00454-008-9130-6

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Untangling circular drawings: Algorithms and complexity;Computational Geometry;2023-04

2. Dual Circumference and Collinear Sets;Discrete & Computational Geometry;2022-09-12

3. Every Collinear Set in a Planar Graph is Free;Discrete & Computational Geometry;2020-01-17

4. Drawing Planar Graphs with Many Collinear Vertices;Lecture Notes in Computer Science;2016

5. The Utility of Untangling;Lecture Notes in Computer Science;2015