Geometric thickness of multigraphs is \(\exists \mathbb{R} \)-complete

DOI10.1007/978-3-031-55598-5_22MaRDI QIDQ6547943

Irene Parada, Soeren Terziadis, Henry Förster, Birgit Vogtenhuber, Philipp Kindermann, Tilmann Miltzow

Publication date: 31 May 2024

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Thickness and colorability of geometric graphs
• Planar graphs: Theory and algorithms
• Thickness and coarseness of graphs
• Complexity of Some Geometric and Topological Problems
• Determining the thickness of graphs is NP-hard
• THE THICKNESS OF AN ARBITRARY COMPLETE GRAPH
• Geometric Thickness of Complete Graphs
• Planar Graphs Have Bounded Queue-Number
• Complexity of Geometric k-Planarity for Fixed k
• The Complexity of Simultaneous Geometric Graph Embedding
• Simultaneous Geometric Graph Embeddings
• The Thickness of the Complete Graph
• On the Complexity of Some Geometric Problems With Fixed Parameters
• Graph product structure for non-minor-closed classes

This page was built for publication: Geometric thickness of multigraphs is \(\exists \mathbb{R} \)-complete

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