Before revision:  We obtain results on the maximum density , drawability of complete graphs, complexity of the recognition problem, and relationships with other families of beyond-planar graphs.
After revision:  We present results on the maximum density , drawability of complete graphs, complexity of the recognition problem, and relationships with other families of beyond-planar graphs.