Arboricity and bipartite subgraph listing algorithms
Information Processing Letters
Edge-disjoint placement of three trees
European Journal of Combinatorics
An Algorithm for Subgraph Isomorphism
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Edge partition of planar sraphs into two outerplanar graphs
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
On simultaneous planar graph embeddings
Computational Geometry: Theory and Applications
Packing trees into planar graphs
Journal of Graph Theory
Embedding graphs simultaneously with fixed edges
GD'06 Proceedings of the 14th international conference on Graph drawing
Two trees which are self–intersecting when drawn simultaneously
GD'05 Proceedings of the 13th international conference on Graph Drawing
Hi-index | 0.00 |
We consider the following problem: Given a set S of graphs, each of n vertices, construct an n-vertex planar graph G containing all the graphs of S as subgraphs. We distinguish the variant in which any two graphs of S are required to have disjoint edges in G (known as 'packing') from the variant in which distinct graphs of S can share edges in G (called 'squeezing'). About the packing variant we show that an arbitrary tree and an arbitrary spider tree can always be packed in a planar graph, improving in this way partial results recently given on this problem. Concerning the squeezing variant, we consider some important classes of graphs, like paths, trees, outerplanar graphs, etc. and establish positive and negative results.