Partitions of complete geometric graphs into plane trees

DOI10.1016/J.COMGEO.2005.08.006zbMath1091.05018OpenAlexW2124280420MaRDI QIDQ2489020

Eduardo Rivera-Campo, David R. Wood, Prosenjit Bose, Ferran Hurtado

Publication date: 16 May 2006

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2005.08.006

zbMATH Keywords

book embeddingcomplete graphbook thicknesscrossing familyconvex graph

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (9)

Packing plane spanning trees and paths in complete geometric graphs ⋮ Order on order types ⋮ Packing 1-plane Hamiltonian cycles in complete geometric graphs ⋮ On asymptotic packing of convex geometric and ordered graphs ⋮ Packing plane spanning trees into a point set ⋮ Coloring drawings of graphs ⋮ PARTITIONS OF COMPLETE BIPARTITE GEOMETRIC GRAPHS INTO PLANE PERFECT MATCHINGS ⋮ On asymptotic packing of geometric graphs ⋮ Plane Spanning Trees in Edge-Colored Simple Drawings of $$K_{n}$$

Cites Work

• Unnamed Item
• Unnamed Item
• The book thickness of a graph
• Crossing families
• On the chromatic number of some geometric type Kneser graphs
• Thickness and coarseness of graphs
• Packing trees into planar graphs
• On the Problem of Decomposing a Graph into n Connected Factors
• Geometric Thickness of Complete Graphs
• The geometric thickness of low degree graphs
• Decomposition of Finite Graphs Into Forests
• Graph Drawing

This page was built for publication: Partitions of complete geometric graphs into plane trees