✦ LIBER ✦

Partitions of complete geometric graphs into plane trees

✍ Scribed by Prosenjit Bose; Ferran Hurtado; Eduardo Rivera-Campo; David R. Wood

Book ID: 108100944
Publisher: Elsevier Science
Year: 2006
Tongue: English
Weight: 501 KB
Volume: 34
Category: Article
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2005.08.006

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On partitions of graphs into trees

✍ F.R.K. Chung 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 934 KB

We crgnsider the minimum m\*-nber T(G) of subsets intl:, which the edge set E(G) of a graph G can lx partitioned so that each subset forms a tree. It is shown that for any connected (3 with II vertices, we always have T( Gj s [$I.

Decomposition of the completer-graph int

Decomposition of the completer-graph into completer-partiter-graphs

✍ Noga Alon 📂 Article 📅 1986 🏛 Springer Japan 🌐 English ⚖ 307 KB

Spanners of Complete k -Partite Geometri

Spanners of Complete k -Partite Geometric Graphs

✍ Bose, Prosenjit; Carmi, Paz; Couture, Mathieu; Maheshwari, Anil; Morin, Pat; Smi 📂 Article 📅 2009 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 259 KB

Partitioning complete graphs by heteroch

Partitioning complete graphs by heterochromatic trees

✍ Ze-min Jin, Xue-liang Li 📂 Article 📅 2012 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 194 KB

Packing trees into complete bipartite gr

Packing trees into complete bipartite graphs

✍ Hollingsworth, Susan 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 350 KB

Complete partitions of graphs

✍ Magnús M. Halldórsson; Guy Kortsarz; Jaikumar Radhakrishnan; Sivaramakrishnan Si 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 393 KB