The crossing number is a popular tool in graph drawing and visualization, but there is not
really just one crossing number; there is a large family of crossing number notions of which …

A graph is 1‐planar if it can be drawn on the plane so that each edge is crossed by no more
than one other edge (and any pair of crossing edges cross only once). A non‐1‐planar …

A graph is near-planar if it can be obtained from a planar graph by adding an edge. We
show the surprising fact that it is NP-hard to compute the crossing number of near-planar …

A plane graph is a graph embedded in a plane without edge crossings. Fáry's theorem
states that every plane graph can be drawn as a straight-line drawing, preserving the …

A Right Angle Crossing Graph (also called a RAC graph for short) is a graph that has a
straight-line drawing where any two crossing edges are orthogonal to each other. A 1-planar …

A graph is 1-planar if it can be drawn in the plane such that each edge is crossed at most
once. It is maximal 1-planar if the addition of any edge violates 1-planarity. Maximal 1-planar …

The crossing-angle resolution of a drawing of a graph measures the smallest angle formed
by any pair of crossing edges. In this chapter, we survey some of the most recent results and …

1-planarity of complete multipartite graphs - ScienceDirect Skip to main contentSkip to article
Elsevier logo Journals & Books Search RegisterSign in View PDF Download full issue …

ON PROPERTIES OF MAXIMAL 1-PLANAR GRAPHS1 Page 1 Discussiones Mathematicae
Graph Theory 32 (2012) 737–747 doi:10.7151/dmgt.1639 ON PROPERTIES OF MAXIMAL 1-PLANAR …

The degree diameter problem involves finding the largest graph (in terms of the number of
vertices) subject to constraints on the degree and the diameter of the graph. Beyond the …