Crossings Between Non-homotopic Edges

DOI10.1007/978-3-030-68766-3_28OpenAlexW3134490411MaRDI QIDQ5014129

Gábor Tardos, János Pach, Géza Tóth

Publication date: 1 December 2021

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2006.14908

zbMATH Keywords

loopcrossing numberhomotopic

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

On the intersections of non-homotopic loops ⋮ Non-homotopic loops with a bounded number of pairwise intersections ⋮ On the number of edges of separated multigraphs ⋮ Crossings between non-homotopic edges ⋮ The number of crossings in multigraphs with no empty lens

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improving the crossing lemma by finding more crossings in sparse graphs
• Improved bounds for planar \(k\)-sets and related problems
• A successful concept for measuring non-planarity of graphs: The crossing number.
• The number of crossings in multigraphs with no empty lens
• Systems of curves on surfaces
• The graph crossing number and its variants: a survey
• On topological graphs with at most four crossings per edge
• Crossing Number is NP-Complete
• Crossing-Free Subgraphs
• Crossing Numbers and Hard Erdős Problems in Discrete Geometry
• Crossing Numbers of Graphs
• A crossing lemma for multigraphs