Covering the edges of a complete geometric graph with convex polygons
type: Item
instance of: scholarly article
title: Covering the edges of a complete geometric graph with convex polygons
author: Rom Pinchasi
author: Oren Yerushalmi
published in: Discrete \& Computational Geometry
publication date: 2024-10-25T00:00:00Z
Mathematics Subject Classification ID: 52C99
Mathematics Subject Classification ID: 52C15
zbMATH DE Number: 7931808
zbMATH Keywords: geometric graphs
zbMATH Keywords: convex chains
zbMATH Keywords: concave chains
zbMATH Keywords: convex polygons
MaRDI profile type: Publication
cites work: Packing plane spanning trees and paths in complete geometric graphs
cites work: Edge partitions of complete geometric graphs
cites work: On the chromatic number of some geometric type Kneser graphs
cites work: Crossing families
cites work: Partitions of complete geometric graphs into plane trees
cites work: A combinatorial problem in geometry.
cites work: Packing trees into planar graphs
cites work: On the number of k-subsets of a set of n points in the plane
cites work: Q3138746
cites work: Q5641161
cites work: Order on Order Types
DOI: 10.1007/S00454-023-00548-3
description: scientific article; zbMATH DE number 7931808