  In this paper, we introduce the following new concept in graph drawing. Our
task is to find a small collection of drawings such that they all together
satisfy some property that is useful for graph visualization. We propose
investigating a property where each edge is not crossed in at least one drawing
in the collection. We call such collection uncrossed. Such property is
motivated by a quintessential problem of the crossing number, where one asks
for a plane drawing where the number of edge crossings is minimum. Indeed, if
we are allowed to visualize only one drawing, then the one which minimizes the
number of crossings is probably the neatest for the first orientation. However,
a collection of drawings where each highlights a different aspect of a graph
without any crossings could shed even more light on the graph's structure.
  We propose two definitions. First, the uncrossed number, minimizes the number
of graph drawings in a collection, satisfying the uncrossed property. Second,
the uncrossed crossing number, minimizes the total number of crossings in the
collection that satisfy the uncrossed property. For both definitions, we
establish initial results. We prove that the uncrossed crossing number is
NP-hard, but there is an FPT algorithm parameterized by the solution size.
