Many new graph classes can be defined by the intersection of two
(or more) graph classes or by combining the respective properties
in a drawing. Such "double" classes are largely unexplored, as remarked in [1]}.
Some facts are known about 1-planar and RAC graphs, where IC-planar
combines both properties [2]}. However, there are
graphs that are 1-planar and RAC and are not IC-planar, for example, \(n\) -vertex
tiles, which have too many edges for IC-planarity. There are
NIC-planar that are 1-planar and not RAC [3]}. On the
other hand, \(n\) -vertex RAC graphs with \(4n-10\)  edges
[4]} and \(n\) -vertex fan-crossing free graphs with
\(4n-8\)  edges [5]} are 1-planar. There are non 1-planar graphs that are
both fan-crossing and fan-crossing free [6]}. As last, the 2-planar
fan-crossing graphs are characterized as 5-map graph if the
graphs are clique augmented [7]}.
