Crossings Between Non-homotopic Edges

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

Authors: János Pach, Gábor Tardos, 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

crossing numberloophomotopic

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (6)

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

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)