Log In Sign Up

Packing Trees into 1-planar Graphs

by   Felice De Luca, et al.

We introduce and study the 1-planar packing problem: Given k graphs with n vertices G_1, ..., G_k, find a 1-planar graph that contains the given graphs as edge-disjoint spanning subgraphs. We mainly focus on the case when each G_i is a tree and k=3. We prove that a triple consisting of three caterpillars or of two caterpillars and a path may not admit a 1-planar packing, while two paths and a special type of caterpillar always have one. We then study 1-planar packings with few crossings and prove that three paths (resp. cycles) admit a 1-planar packing with at most seven (resp. fourteen) crossings. We finally show that a quadruple consisting of three paths and a perfect matching with n ≥ 12 vertices admits a 1-planar packing, while such a packing does not exist if n ≤ 10.


page 1

page 2

page 3

page 4


Planar Perfect Matching is in NC

In this paper we show that the problem of computing perfect matchings in...

Kernelization for Graph Packing Problems via Rainbow Matching

We introduce a new kernelization tool, called rainbow matching technique...

Computing Circle Packing Representations of Planar Graphs

The Circle Packing Theorem states that every planar graph can be represe...

J-Logic: a Logic for Querying JSON

We propose a logical framework, based on Datalog, to study the foundatio...

On Packing Low-Diameter Spanning Trees

Edge connectivity of a graph is one of the most fundamental graph-theore...

Labeled Packing of Cycles and Circuits

In 2013, Duchêne, Kheddouci, Nowakowski and Tahraoui [4, 9] introduced a...

Dots Polygons

We present a new game, Dots Polygons, played on a planar point set. ...