Three edge-disjoint plane spanning paths in a point set

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

Philipp Kindermann, Giuseppe Liotta, Jan Kratochvíl, 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

• Title not available (Why is that?)
• Packings of graphs and applications to computational complexity
• The planar tree packing theorem
• The book thickness of a graph
• Bipartite embeddings of trees in the plane
• Applications of a semi-dynamic convex hull algorithm
• Packing two graphs of order n having total size at most 2n-2
• Partitions of complete geometric graphs into plane trees
• Packing plane spanning trees and paths in complete geometric graphs
• Packing four copies of a tree into a complete graph
• Packing Trees into 1-planar Graphs

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)