Document
Hamiltonian Properties of Cycle-Trees (Poster Abstract)
Authors
Giordano Andreola 
,
Giordano Da Lozzo ,
Marco D'Elia
-
Part of:
Volume:
34th International Symposium on Graph Drawing and Network Visualization (GD 2026)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: Graph Drawing and Network Visualization (GD) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2026-11-12
File
PDF
LIPIcs.GD.2026.42.pdf
- Filesize: 1.02 MB
- 5 pages
Author Details
References
- Michael A. Bekos, Giordano Da Lozzo, Fabrizio Frati, Siddharth Gupta, Philipp Kindermann, Giuseppe Liotta, Ignaz Rutter, and Ioannis G. Tollis. Weakly leveled planarity with bounded span. Theor. Comput. Sci., 1069:115811, 2026. URL: https://doi.org/10.1016/J.TCS.2026.115811.
- Therese Biedl and Milap Sheth. Drawing halin-graphs with small height. J. Graph Algorithms Appl., 26(1):473-502, 2022. URL: https://doi.org/10.7155/JGAA.00604.
- Steven Chaplick, Giordano Da Lozzo, Emilio Di Giacomo, Giuseppe Liotta, and Fabrizio Montecchiani. Planar drawings with few slopes of Halin graphs and nested pseudotrees. Algorithmica, 86(8):2413-2447, 2024. URL: https://doi.org/10.1007/S00453-024-01230-7.
- G. Cornuéjols, D. Naddef, and W. R. Pulleyblank. Halin graphs and the travelling salesman problem. Mathematical Programming, 26(3):287-294, 1983. URL: https://doi.org/10.1007/BF02591867.
- Giordano Da Lozzo, Anthony D'Angelo, and Fabrizio Frati. On planar greedy drawings of 3-connected planar graphs. Discret. Comput. Geom., 63(1):114-157, 2020. URL: https://doi.org/10.1007/S00454-018-0001-5.
- Giordano Da Lozzo, Anthony D'Angelo, and Fabrizio Frati. On the area requirements of planar greedy drawings of triconnected planar graphs. In Donghyun Kim, R. N. Uma, Zhipeng Cai, and Dong Hoon Lee, editors, Computing and Combinatorics - 26th International Conference, COCOON 2020, volume 12273 of LNCS, pages 435-447. Springer, 2020. URL: https://doi.org/10.1007/978-3-030-58150-3_35.
- Giordano Da Lozzo, William E. Devanny, David Eppstein, and Timothy Johnson. Square-contact representations of partial 2-trees and triconnected simply-nested graphs. In Yoshio Okamoto and Takeshi Tokuyama, editors, 28th International Symposium on Algorithms and Computation, ISAAC 2017, volume 92 of LIPIcs, pages 24:1-24:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. URL: https://doi.org/10.4230/LIPIcs.ISAAC.2017.24.
-
Giuseppe Di Battista, Peter Eades, Roberto Tamassia, and Ioannis G. Tollis. Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall, 1999.
-
Reinhard Diestel. Graph Theory, 4th Edition, volume 173 of Graduate Texts in Mathematics. Springer, 2012.
- L. Lovász and M. D. Plummer. On a family of planar bicritical graphs. Proceedings of the London Mathematical Society, s3-30(2):160-176, 1975. URL: https://doi.org/10.1112/plms/s3-30.2.160.