These properties are fulfilled by the aforementioned “major”
beyond-planar graph classes and by almost all graph classes listed
in [1]}. Graphs that are defined by
generalized visibility representations, such as bar-\(k\) 
[2]} and shape visibility [3]}, [4]}, [5]} satisfy (i)-(iii), as well as
graphs with bounded
thickness [6]}, [4]}, bounded stack number (or
book thickness \(k\) ) [8]}, [9]}, [10]}
bounded queue number
[9]}, [12]}, mixed stack queue graphs [9]},
and multiple deque layouts [14]}. In all these
cases, the graphs have a visual representation, which may use an
edge coloring and a linear vertex ordering.
