Packing Trees into 1-planar Graphs
From MaRDI portal
Publication:5084698
DOI10.7155/jgaa.00574zbMath1489.05142OpenAlexW3212242038MaRDI QIDQ5084698
Giuseppe Liotta, Stephen G. Kobourov, Alessandra Tappini, Seok-Hee Hong, Emilio Di Giacomo, Felice De Luca, Stephen K. Wismath, William J. Lenhart, Henk G. Meijer
Publication date: 28 June 2022
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7155/jgaa.00574
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (1)
Cites Work
- Unnamed Item
- 1-planarity of complete multipartite graphs
- Edge disjoint placement of graphs
- Packing trees into 1-planar graphs
- Planar packing of trees and spider trees
- Packing three copies of a tree into a complete graph
- Graphs drawn with few crossings per edge
- Recognizing optimal 1-planar graphs in linear time
- Edge-disjoint placement of three trees
- Triple placement of graphs
- Ein Sechsfarbenproblem auf der Kugel
- An annotated bibliography on 1-planarity
- Minimal non-1-planar graphs
- Planar Packing of Binary Trees
- Packing trees into planar graphs
- The planar tree packing theorem
This page was built for publication: Packing Trees into 1-planar Graphs