k-Planar Placement and Packing of Δ-Regular Caterpillars

DOI10.1142/s0129054123420042zbMath1526.05112arXiv2301.01226OpenAlexW4377824146MaRDI QIDQ6066468

Alessandra Tappini, Giuseppe Liotta, Emilio Di Giacomo, Carla Binucci, Michael Kaufmann

Publication date: 16 November 2023

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2301.01226

zbMATH Keywords

graph packing\(k\)-planaritybeyond planaritygraph placement

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• A note on \(k\)-placeable graphs
• 1-planarity of complete multipartite graphs
• Edge disjoint placement of graphs
• Packing two graphs of order n having total size at most 2n-2
• Planar packing of trees and spider trees
• Packing three copies of a tree into a complete graph
• Packings of graphs and applications to computational complexity
• 1-fan-bundle-planar drawings of graphs
• Edge-disjoint placement of three trees
• On topological graphs with at most four crossings per edge
• Triple placement of graphs
• An annotated bibliography on 1-planarity
• Packing plane spanning trees and paths in complete geometric graphs
• Planar Packing of Binary Trees
• Packing trees into planar graphs
• Beyond Clustered Planar Graphs
• Packing Trees into 1-planar Graphs
• Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity
• The planar tree packing theorem
• Drawing graphs. Methods and models
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item