The number of crossings in multigraphs with no empty lens

DOI10.7155/JGAA.00563zbMATH Open1489.05031OpenAlexW3200650068WikidataQ121545998 ScholiaQ121545998MaRDI QIDQ5084684FDOQ5084684

Authors:

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

Recommendations

• The number of crossings in multigraphs with no empty lens
• A crossing lemma for multigraphs
• A crossing lemma for multigraphs
• Improving the crossing lemma by finding more crossings in sparse graphs
• Crossings between non-homotopic edges

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
• Crossing Numbers and Hard Erdős Problems in Discrete Geometry
• Crossing-Free Subgraphs
• The number of edges in \(k\)-quasi-planar graphs
• The Moore bound for irregular graphs
• New bounds on crossing numbers
• Crossings Between Non-homotopic Edges
• The number of crossings in multigraphs with no empty lens
• On the Maximum Number of Crossings in Star-Simple Drawings of $$K_n$$ with No Empty Lens
• A crossing lemma for multigraphs

Cited In (4)

• The number of crossings in multigraphs with no empty lens
• On the maximum number of crossings in star-simple drawings of \(K_n\) with no empty lens
• A crossing lemma for multigraphs
• Crossings between non-homotopic edges

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

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