Decomposition of geometric graphs into star-forests

DOI10.1016/J.COMGEO.2025.102186MaRDI QIDQ6964867zbMATH OpenFDO

Authors János Pach, Morteza Saghafian, Patrick Schnider

Publication date 4 July 2025

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.COMGEO.2025.102186

zbMATH Keywords

geometric graphsgraph decompositiongraph thicknessstar forests

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (including graph drawing) in computer science (68R10)

Cites work

• Decomposition of Finite Graphs Into Forests
• Edge partitions of complete geometric graphs
• Forests, frames, and games: Algorithms for matroid sums and applications
• Graph treewidth and geometric thickness parameters
• scientific article; zbMATH DE number 3643294 (Why is no real title available?)
• scientific article; zbMATH DE number 125471 (Why is no real title available?)
• scientific article; zbMATH DE number 3893247 (Why is no real title available?)
• scientific article; zbMATH DE number 3253072 (Why is no real title available?)
• Minimum partition of a matroid into independent subsets
• On an estimate of the chromatic class of a \(p\)-graph
• On the Addressing Problem for Loop Switching
• On the chromatic number of some geometric type Kneser graphs
• Star arboricity
• Star arboricity of graphs
• Star-forest decompositions of complete graphs
• The beginnings of geometric graph theory

This page was built for publication: Decomposition of geometric graphs into star-forests

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6964867)