On the maximum number of crossings in star-simple drawings of K_n with no empty lens

DOI10.7155/JGAA.00600MaRDI QIDQ5050004zbMATH OpenOpenAlexFDO

Authors

Publication date 14 November 2022

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

Copyright license Creative Commons Attribution 4.0 International

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

Mathematics Subject Classification ID

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

Recommendations

• The number of crossings in multigraphs with no empty lens
• The number of crossings in multigraphs with no empty lens
• scientific article; zbMATH DE number 4198021
• Publication:4862893
• A crossing lemma for multigraphs

Cites work

• A crossing lemma for multigraphs
• A fast algorithm to generate open meandric systems and meanders
• Crossing numbers and combinatorial characterization of monotone drawings of \(K_n\)
• Foldings and meanders
• scientific article; zbMATH DE number 1452728 (Why is no real title available?)
• Intersections of curves on surfaces
• Meander knots and links
• Simple realizability of complete abstract topological graphs simplified
• The graph crossing number and its variants: a survey
• The number of crossings in multigraphs with no empty lens

Cited in

(1)

• The number of crossings in multigraphs 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 Q5050004)