The number of crossings in multigraphs with no empty lens

DOI10.1007/978-3-030-04414-5_17OpenAlexW2889238270MaRDI QIDQ1725755

Xianqiang Yang

Publication date: 15 February 2019

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

Mathematics Subject Classification ID

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

Related Items (7)

On the Maximum Number of Crossings in Star-Simple Drawings of $K_n$ with No Empty Lens ⋮ On the number of edges of separated multigraphs ⋮ Crossings between non-homotopic edges ⋮ A crossing lemma for multigraphs ⋮ The number of crossings in multigraphs with no empty lens ⋮ Quantitative Restrictions on Crossing Patterns ⋮ Crossings Between Non-homotopic Edges

Cites Work

• The Moore bound for irregular graphs
• New bounds on crossing numbers
• Crossing-Free Subgraphs
• Crossing Numbers and Hard Erdős Problems in Discrete Geometry
• A crossing lemma for multigraphs

This page was built for publication: The number of crossings in multigraphs with no empty lens