The number of crossings in multigraphs with no empty lens

DOI10.7155/jgaa.00563zbMath1489.05031OpenAlexW3200650068WikidataQ121545998 ScholiaQ121545998MaRDI QIDQ5084684

No author found.

Publication date: 28 June 2022

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7155/jgaa.00563

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• Graphs drawn with few crossings per edge
• The Moore bound for irregular graphs
• New bounds on crossing numbers
• The number of crossings in multigraphs with no empty lens
• A crossing lemma for multigraphs
• Crossing-Free Subgraphs
• Crossing Numbers and Hard Erdős Problems in Discrete Geometry
• Crossings Between Non-homotopic Edges
• On the Maximum Number of Crossings in Star-Simple Drawings of $$K_n$$ with No Empty Lens
• The Number of Edges in $k$-Quasi-planar Graphs

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