Upper and Lower Bounds on Long Dual Paths in Line Arrangements

DOI10.1007/978-3-662-48054-0_34zbMath1468.52017arXiv1506.03728OpenAlexW2964077821MaRDI QIDQ2946411

Udo Hoffmann, Linda Kleist, Tillmann Miltzow

Publication date: 16 September 2015

Published in: Mathematical Foundations of Computer Science 2015 (Search for Journal in Brave)

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

zbMATH Keywords

coloringline arrangementspseudoline arrangements

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Planar arrangements of lines and pseudolines (aspects of discrete geometry) (52C30)

Related Items (1)

Upper and Lower Bounds on Long Dual Paths in Line Arrangements

Cites Work

• Upper and Lower Bounds on Long Dual Paths in Line Arrangements
• A Theorem on Planar Graphs
• Arrangements of Lines with a Large Number of Triangles
• Unnamed Item
• Unnamed Item

This page was built for publication: Upper and Lower Bounds on Long Dual Paths in Line Arrangements