Three edge-disjoint plane spanning paths in a point set

DOI10.1007/978-3-031-49272-3_22MaRDI QIDQ6560157FDOQ6560157

Authors Philipp Kindermann, Jan Kratochvíl, Giuseppe Liotta, Pavel Valtr

Publication date 21 June 2024

zbMATH Keywords

point setsgeometric graph theoryplane spanning paths

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites work

• scientific article; zbMATH DE number 3771651 (Why is no real title available?)
• Applications of a semi-dynamic convex hull algorithm
• Bipartite embeddings of trees in the plane
• Packing four copies of a tree into a complete graph
• Packing plane spanning trees and paths in complete geometric graphs
• Packing trees into 1-planar graphs
• Packing two graphs of order n having total size at most 2n-2
• Packings of graphs and applications to computational complexity
• Partitions of complete geometric graphs into plane trees
• The book thickness of a graph
• The planar tree packing theorem

This page was built for publication: Three edge-disjoint plane spanning paths in a point set

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