On the maximum number of edges in topological graphs with no four pairwise crossing edges

MaRDI QIDQ3601547zbMATH OpenFDO

Authors Eyal Ackerman

Publication date 10 February 2009

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• On the maximum number of edges in topological graphs with no four pairwise crossing edges
• On topological graphs with at most four crossings per edge
• Degenerate crossing numbers
• Crossing Stars in Topological Graphs
• Crossing Stars in Topological Graphs

Cited in

(15)

• On the maximum number of edges in quasi-planar graphs
• On planar intersection graphs with forbidden subgraphs
• The maximum number of edges in geometric graphs with pairwise virtually avoiding edges
• On the maximum number of edges in topological graphs with no four pairwise crossing edges
• On topological graphs with at most four crossings per edge
• On disjoint crossing families in geometric graphs
• Topological hypergraphs
• Topological graphs with no self-intersecting cycle of length 4
• Graph Drawing
• String graphs and incomparability graphs
• Combinatorial Geometry and Graph Theory
• Degenerate crossing numbers
• Crossing Stars in Topological Graphs
• \(k\)-quasi-planar graphs
• Intersection reverse sequences and geometric applications.

This page was built for publication: On the maximum number of edges in topological graphs with no four pairwise crossing edges

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3601547)