Plane Spanning Trees in Edge-Colored Simple Drawings of $$K_{n}$$

DOI10.1007/978-3-030-68766-3_37OpenAlexW3135333093MaRDI QIDQ5014139

No author found.

Publication date: 1 December 2021

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2008.08827

zbMATH Keywords

monotone drawingcylindrical drawingsimple drawingplane subdrawing

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• A sufficient condition for the existence of plane spanning trees on geometric graphs
• The book thickness of a graph
• Ramsey-type results for geometric graphs. I
• The graph crossing number and its variants: a survey
• Packing plane spanning trees into a point set
• Partitions of complete geometric graphs into plane trees
• Blockers for Noncrossing Spanning Trees in Complete Geometric Graphs
• Crossing Number Problems
• Enumeration of simple complete topological graphs
• Multicolored trees in complete graphs

This page was built for publication: Plane Spanning Trees in Edge-Colored Simple Drawings of $$K_{n}$$