The number of crossings in multigraphs with no empty lens
From MaRDI portal
Publication:5084684
Recommendations
Cites work
- A crossing lemma for multigraphs
- Crossing Numbers and Hard Erdős Problems in Discrete Geometry
- Crossing-Free Subgraphs
- Crossings Between Non-homotopic Edges
- Graphs drawn with few crossings per edge
- New bounds on crossing numbers
- On the Maximum Number of Crossings in Star-Simple Drawings of K_n with No Empty Lens
- The Moore bound for irregular graphs
- The number of crossings in multigraphs with no empty lens
- The number of edges in k-quasi-planar graphs
Cited in
(10)- The number of crossings in multigraphs with no empty lens
- Crossings between non-homotopic edges
- Crossings Between Non-homotopic Edges
- On the maximum number of crossings in star-simple drawings of \(K_n\) with no empty lens
- A crossing lemma for multigraphs
- Improving the crossing lemma by characterizing dense 2-planar and 3-planar graphs
- 1-planar unit distance graphs
- On the number of edges of separated multigraphs
- Improving the Crossing Lemma by characterizing dense 2-planar and 3-planar graphs
- Non-homotopic drawings of multigraphs
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)