On the maximum number of edges in topological graphs with no four pairwise crossing edges
From MaRDI portal
Publication:1014335
DOI10.1007/s00454-009-9143-9zbMath1161.05313OpenAlexW2047142187MaRDI QIDQ1014335
Publication date: 27 April 2009
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-009-9143-9
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items (36)
The density of fan-planar graphs ⋮ On quasi-planar graphs: clique-width and logical description ⋮ On topological graphs with at most four crossings per edge ⋮ Approximating maximum diameter-bounded subgraph in unit disk graphs ⋮ On the recognition of fan-planar and maximal outer-fan-planar graphs ⋮ Coloring curves that cross a fixed curve ⋮ Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane ⋮ Quasiplanar graphs, string graphs, and the Erdős-Gallai problem ⋮ On the Size of Planarly Connected Crossing Graphs ⋮ On the edge crossing properties of Euclidean minimum weight Laman graphs ⋮ New bounds on the maximum number of edges in \(k\)-quasi-planar graphs ⋮ Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs ⋮ Counting Plane Graphs: Cross-Graph Charging Schemes ⋮ Beyond Outerplanarity ⋮ A linear-time algorithm for testing full outer-2-planarity ⋮ Simple \(k\)-planar graphs are simple \((k + 1)\)-quasiplanar ⋮ Applications of a New Separator Theorem for String Graphs ⋮ Triangle-free geometric intersection graphs with no large independent sets ⋮ Two-Planar Graphs Are Quasiplanar ⋮ Unnamed Item ⋮ On-line approach to off-line coloring problems on graphs with geometric representations ⋮ On RAC drawings of graphs with one bend per edge ⋮ On RAC drawings of graphs with one bend per edge ⋮ Planar point sets determine many pairwise crossing segments ⋮ The maximum number of edges in geometric graphs with pairwise virtually avoiding edges ⋮ An upper bound on the number of edges in an almost planar bipartite graph ⋮ Twenty years of progress of \(\mathrm{JCDCG}^3\) ⋮ Testing Full Outer-2-planarity in Linear Time ⋮ Outerstring Graphs are $\chi$-Bounded ⋮ Beyond Planar Graphs: Introduction ⋮ Quantitative Restrictions on Crossing Patterns ⋮ Quasi-planar Graphs ⋮ Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs ⋮ 2-Layer k-Planar Graphs ⋮ Fan-planarity: properties and complexity ⋮ On the Number of Edges of Fan-Crossing Free Graphs
Cites Work
This page was built for publication: On the maximum number of edges in topological graphs with no four pairwise crossing edges
