CCCG
2009
14 years 1 months ago
2009
We prove that, for every two n-node non-star trees of diameter at most four, there exists an n-node planar graph containing them as edge-disjoint subgraphs.