Planar Packing of Diameter-Four Trees

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.

• Type: Conference
• Year: 2009
• Where: CCCG
• Authors: Fabrizio Frati
• Keywords: CCCG 2007, CCCG 2009, N-node Non-star Trees, N-node Planar Graph