On the Maximum Number of Crossings in Star-Simple Drawings of K_n with No Empty Lens

DOI10.1007/978-3-030-68766-3_30OpenAlexW3134665773MaRDI QIDQ5014131FDOQ5014131

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.11058

zbMATH Keywords

topological graphsedge crossingsstar-simple drawings

Mathematics Subject Classification ID

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

Cites Work

• Crossing numbers and combinatorial characterization of monotone drawings of \(K_n\)
• A crossing lemma for multigraphs
• Simple realizability of complete abstract topological graphs simplified
• Simple realizability of complete abstract topological graphs simplified

Cited In (5)

• The number of crossings in multigraphs with no empty lens
• The number of crossings in multigraphs with no empty lens
• Edge-minimum saturated \(k\)-planar drawings
• Edge-minimum saturated \(k\)-planar drawings
• On the Maximum Number of Crossings in Star-Simple Drawings of $K_n$ with No Empty Lens

This page was built for publication: On the Maximum Number of Crossings in Star-Simple Drawings of $$K_n$$ with No Empty Lens

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