Log In Sign Up

On Fan-Crossing Graphs

by   Franz J. Brandenburg, et al.

A fan is a set of edges with a single common endpoint. A graph is fan-crossing if it admits a drawing in the plane so that each edge is crossed by edges of a fan. It is fan-planar if, in addition, the common endpoint is on the same side of the crossed edge. A graph is adjacency-crossing if it admits a drawing so that crossing edges are adjacent. Then it excludes independent crossings which are crossings by edges with no common endpoint. Adjacency-crossing allows triangle-crossings in which an edge crosses the edges of a triangle, which is excluded at fan-crossing graphs. We show that every adjacency-crossing graph is fan-crossing. Thus triangle-crossings can be avoided. On the other hand, there are fan-crossing graphs that are not fan-planar, whereas for every fan-crossing graph there is a fan-planar graph on the same set of vertices and with the same number of edges. Hence, fan-crossing and fan-planar graphs are different, but they do not differ in their density with at most 5n - 10 edges for graphs of size n.


page 1

page 2

page 3

page 4


Fan-Crossing Free Graphs

A graph is fan-crossing free if it admits a drawing in the plane so that...

Polyline Drawings with Topological Constraints

Let G be a simple topological graph and let Γ be a polyline drawing of G...

Limiting crossing numbers for geodesic drawings on the sphere

We introduce a model for random geodesic drawings of the complete bipart...

On flips in planar matchings

In this paper we investigate the structure of a flip graph on non-crossi...

Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics

We present a thorough experimental evaluation of several crossing minimi...

Edge-Minimum Saturated k-Planar Drawings

For a class 𝒟 of drawings of loopless multigraphs in the plane, a drawin...

Towards Better Approximation of Graph Crossing Number

Graph Crossing Number is a fundamental problem with various applications...