AI Chat AI Image Generator AI Video Text to Speech

Decomposition of Geometric Graphs into Star Forests

06/22/2023

∙

by János Pach, et al.

∙

∙

We solve a problem of Dujmović and Wood (2007) by showing that a complete convex geometric graph on n vertices cannot be decomposed into fewer than n-1 star-forests, each consisting of noncrossing edges. This bound is clearly tight. We also discuss similar questions for abstract graphs.

János Pach
9 publications
Morteza Saghafian
5 publications
Patrick Schnider
22 publications

page 1

page 2

page 3

page 4

research

∙ 02/28/2023

On the geometric thickness of 2-degenerate graphs

A graph is 2-degenerate if every subgraph contains a vertex of degree at...

0 Rahul Jain, et al. ∙

research

∙ 06/19/2020

Universal Geometric Graphs

We introduce and study the problem of constructing geometric graphs that...

0 Fabrizio Frati, et al. ∙

research

∙ 11/24/2019

Intersection graph of maximal stars

A biclique of a graph G is an induced complete bipartite subgraph of G s...

0 Guilherme C. M. Gomes, et al. ∙

research

∙ 09/22/2020

On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition

Given a graph G=(V,E) with arboricity α, we study the problem of decompo...

0 David G. Harris, et al. ∙

research

∙ 02/14/2022

Polyhedron Kernel Computation Using a Geometric Approach

The geometric kernel (or simply the kernel) of a polyhedron is the set o...

0 Tommaso Sorgente, et al. ∙

research

∙ 09/04/2023

Thick Forests

We consider classes of graphs, which we call thick graphs, that have the...

0 Martin Dyer, et al. ∙

research

∙ 10/11/2022

Transforming RDF-star to Property Graphs: A Preliminary Analysis of Transformation Approaches – extended version

RDF and property graph models have many similarities, such as using basi...

0 Ghadeer Abuoda, et al. ∙