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

DOI10.7155/JGAA.00600zbMATH Open1498.05076OpenAlexW3081482445MaRDI QIDQ5050004FDOQ5050004

Author name not available (Why is that?)

Publication date: 14 November 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.00600

Mathematics Subject Classification ID

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

Cites Work

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

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)