Drawing Graphs on Few Circles and Few Spheres-Reference-Cited by-同舟云学术

Drawing Graphs on Few Circles and Few Spheres

Published:2018 Issue: Volume: Page:164-178
ISSN:0302-9743
Container-title:Algorithms and Discrete Applied Mathematics
language:
Short-container-title:

Author:

Kryven Myroslav,Ravsky Alexander,Wolff Alexander^ORCID

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-74180-2_14

Reference20 articles.

1. Akiyama, J., Exoo, G., Harary, F.: Covering and packing ingraphs III: cyclic and acyclic invariants. Math. Slovaca 30, 405–417 (1980)

2. Bernhart, F., Kainen, P.C.: The book thickness of a graph. J. Combin. Theory Ser. B 27(3), 320–331 (1979). http://www.sciencedirect.com/science/article/pii/0095895679900212

3. Brannan, D.A.: Geometry. Cambridge University Press, Cambridge (1999)

4. Lecture Notes in Computer Science;S Chaplick,2016

5. Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, Upper Saddle River (1999)

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

1. State of the Art of Graph Visualization in non‐Euclidean Spaces;Computer Graphics Forum;2024-06

2. The Parametrized Complexity of the Segment Number;Lecture Notes in Computer Science;2023

3. The Segment Number: Algorithms and Universal Lower Bounds for Some Classes of Planar Graphs;Graph-Theoretic Concepts in Computer Science;2022

4. Drawing Planar Graphs with Few Segments on a Polynomial Grid;Lecture Notes in Computer Science;2019

5. Drawing Graphs on Few Circles and Few Spheres;Algorithms and Discrete Applied Mathematics;2018