Packing trees into 1-planar graphs

DOI10.7155/JGAA.00574MaRDI QIDQ5084698zbMATH OpenOpenAlexFDO

Authors Felice De Luca, Emilio Di Giacomo, Seok-Hee Hong, Stephen G. Kobourov, Giuseppe Liotta, Alessandra Tappini, William Lenhart, Henk Meijer, S. Wismath

Publication date 28 June 2022

Published in Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.7155/jgaa.00574

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• The planar tree packing theorem
• The planar tree packing theorem
• Packing and Squeezing Subgraphs into Planar Graphs
• Packing trees into planar graphs
• Planar packing of binary trees

Cites work

• scientific article; zbMATH DE number 3771651 (Why is no real title available?)
• 1-planarity of complete multipartite graphs
• An annotated bibliography on 1-planarity
• Edge disjoint placement of graphs
• Edge-disjoint placement of three trees
• Ein Sechsfarbenproblem auf der Kugel
• Graphs drawn with few crossings per edge
• Minimal non-1-planar graphs
• Packing three copies of a tree into a complete graph
• Packing trees into 1-planar graphs
• Packing trees into planar graphs
• Planar packing of binary trees
• Planar packing of trees and spider trees
• Recognizing optimal 1-planar graphs in linear time
• The planar tree packing theorem
• Triple placement of graphs

Cited in

(4)

• Three edge-disjoint plane spanning paths in a point set
• Planar packing of binary trees
• k-Planar Placement and Packing of Δ-Regular Caterpillars
• Packing and Squeezing Subgraphs into Planar Graphs

This page was built for publication: Packing trees into 1-planar graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5084698)