Compatible spanning trees in simple drawings of \(K_n\)

DOI10.1007/978-3-031-22203-0_2arXiv2208.11875OpenAlexW4317393937MaRDI QIDQ6117032

Kristin Knorr, Johannes Obenaus, Rosna Paul, Wolfgang Mulzer, Oswin Aichholzer, Birgit Vogtenhuber, Alexandra Weinberger, Meghana M. Reddy, Nicolas El Maalouly

Publication date: 16 August 2023

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

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

zbMATH Keywords

compatibility graphplane spanning treesimple drawing

Mathematics Subject Classification ID

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

Cites Work

• Compatible geometric matchings
• Flips in planar graphs
• Transforming spanning trees: A lower bound
• Transforming spanning trees and pseudo-triangulations
• Linear transformation distance for bichromatic matchings
• Disjoint compatible geometric matchings
• The graph crossing number and its variants: a survey
• Disjoint compatibility graph of non-crossing matchings of points in convex position
• Bichromatic compatible matchings
• Transforming triangulations
• Bemerkungen zum Vierfarbenproblem
• On plane subgraphs of complete topological drawings
• Shooting stars in simple drawings of \(K_{m,n}\)

This page was built for publication: Compatible spanning trees in simple drawings of \(K_n\)