On topological graphs with at most four crossings per edge

DOI10.1016/j.comgeo.2019.101574zbMath1439.05163arXiv1509.01932OpenAlexW2972631639MaRDI QIDQ2175439

Eyal Ackerman

Publication date: 29 April 2020

Published in: Computational Geometry (Search for Journal in Brave)

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

zbMATH Keywords

crossing lemmatopological graphs\(k\)-planar graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items

Edge-minimum saturated \(k\)-planar drawings, Recognizing and embedding simple optimal 2-planar graphs, The crossing number of twisted graphs, Genus, thickness and crossing number of graphs encoding the generating properties of finite groups, Crossing Numbers of Beyond-Planar Graphs Revisited, Fan-crossing free graphs and their relationship to other beyond-planar graphs, Crossings between non-homotopic edges, k-Planar Placement and Packing of Δ-Regular Caterpillars, Crossings in grid drawings, The family of fan-planar graphs, The constant of point-line incidence constructions, A structural Szemerédi-Trotter theorem for Cartesian products, The thickness of fan-planar graphs is at most three, Covering lattice points by subspaces and counting point-hyperplane incidences, Unnamed Item, Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity, Two-Planar Graphs Are Quasiplanar, Unnamed Item, On RAC drawings of graphs with one bend per edge, On RAC drawings of graphs with one bend per edge, A survey of graphs with known or bounded crossing numbers, Quantitative Restrictions on Crossing Patterns, $$\textit{\textbf{k}}$$-Planar Graphs, Crossing lemma for the odd-crossing number, Crossings Between Non-homotopic Edges, Improvement on the Crossing Number of Crossing-Critical Graphs, Simple Topological Drawings of k-Planar Graphs, 2-Layer k-Planar Graphs, Improvement on the crossing number of crossing-critical graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Graphs that admit right angle crossing drawings
• Improving the crossing lemma by finding more crossings in sparse graphs
• On the maximum number of edges in quasi-planar graphs
• On the maximum number of edges in topological graphs with no four pairwise crossing edges
• Every planar map is four colorable. I: Discharging
• Graphs drawn with few crossings per edge
• Covering lattice points by subspaces and counting point-hyperplane incidences
• Regular Matchstick Graphs
• Crossing-Free Subgraphs
• An improvement of the crossing number bound