Packing trees into 1-planar graphs

DOI10.7155/JGAA.00574zbMATH Open1489.05142OpenAlexW3212242038MaRDI QIDQ5084698FDOQ5084698

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)

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

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

Mathematics Subject Classification ID

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

Cites Work

• Graphs drawn with few crossings per edge
• Ein Sechsfarbenproblem auf der Kugel
• The planar tree packing theorem
• Edge disjoint placement of graphs
• Packing trees into planar graphs
• Recognizing optimal 1-planar graphs in linear time
• Minimal non-1-planar graphs
• 1-planarity of complete multipartite graphs
• Title not available (Why is that?)
• Planar packing of binary trees
• An annotated bibliography on 1-planarity
• Packing trees into 1-planar graphs
• Edge-disjoint placement of three trees
• Planar packing of trees and spider trees
• Packing three copies of a tree into a complete graph
• 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)