The following pages link to A crossing lemma for multigraphs (Q2189737):
Displaying 11 items.
- A bipartite strengthening of the crossing Lemma (Q968451) (← links)
- Making a graph crossing-critical by multiplying its edges (Q1953450) (← links)
- On the number of edges of separated multigraphs (Q2151445) (← links)
- On topological graphs with at most four crossings per edge (Q2175439) (← links)
- Crossings between non-homotopic edges (Q2673492) (← links)
- Quantitative Restrictions on Crossing Patterns (Q5001654) (← links)
- On the Maximum Number of Crossings in Star-Simple Drawings of $$K_n$$ with No Empty Lens (Q5014131) (← links)
- On the Maximum Number of Crossings in Star-Simple Drawings of $K_n$ with No Empty Lens (Q5050004) (← links)
- The number of crossings in multigraphs with no empty lens (Q5084684) (← links)
- Improving the crossing lemma by finding more crossings in sparse graphs (Q5361656) (← links)
- Edge-minimum saturated \(k\)-planar drawings (Q6565810) (← links)
