Crossings Between Non-homotopic Edges
From MaRDI portal
Publication:5014129
Recommendations
Cites work
- scientific article; zbMATH DE number 3574107 (Why is no real title available?)
- scientific article; zbMATH DE number 1452728 (Why is no real title available?)
- scientific article; zbMATH DE number 3041944 (Why is no real title available?)
- A crossing lemma for multigraphs
- A successful concept for measuring non-planarity of graphs: The crossing number.
- Crossing Number is NP-Complete
- Crossing Numbers and Hard Erdős Problems in Discrete Geometry
- Crossing numbers of graphs
- Crossing-Free Subgraphs
- Improved bounds for planar \(k\)-sets and related problems
- Improving the crossing lemma by finding more crossings in sparse graphs
- On topological graphs with at most four crossings per edge
- Systems of curves on surfaces
- The graph crossing number and its variants: a survey
- The number of crossings in multigraphs with no empty lens
Cited in
(6)
This page was built for publication: Crossings Between Non-homotopic Edges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5014129)