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

DOI10.1007/978-3-030-68766-3_37MaRDI QIDQ5014139zbMATH OpenOpenAlexFDO

Authors

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

cylindrical drawingmonotone drawingplane subdrawingsimple drawing

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 975390
• Compatible spanning trees in simple drawings of \(K_n\)
• Spanning trees with many or few colors in edge-colored graphs
• scientific article; zbMATH DE number 1418267
• Tree spanners in planar graphs
• On plane spanning trees and cycles of multicolored point sets with few intersections
• scientific article; zbMATH DE number 1262806
• Properly colored spanning trees in edge-colored graphs
• Publication:4504031
• On the number of spanning trees a planar graph can have

Cites work

• A sufficient condition for the existence of plane spanning trees on geometric graphs
• Blockers for Noncrossing Spanning Trees in Complete Geometric Graphs
• Crossing Number Problems
• Enumeration of simple complete topological graphs
• scientific article; zbMATH DE number 3825881 (Why is no real title available?)
• Multicolored trees in complete graphs
• Packing plane spanning trees into a point set
• Partitions of complete geometric graphs into plane trees
• Ramsey-type results for geometric graphs. I
• The book thickness of a graph
• The graph crossing number and its variants: a survey

Cited in

(1)

• Minimum partition into plane subgraphs: the CG:SHOP challenge 2022

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

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