On properties of $k$-planar and outer-$k$-planar graphs
Presented by Dr. Tomáš MADARAS
Type: Oral presentation
Track: Crossing Number
A graph $G$ is called $k$-planar if there exists its drawing $D(G)$ in the plane such that each edge of $D(G)$ is crossed at most $k$ times. For small $k$, we survey known results on $k$-planar graphs from the point of view of global properties, algorithmic aspects of recognition, local structure, colourings and hamiltonicity. We also introduce a novel concept of outer-$k$-planar graphs which are analogous to outerplanar graphs, and explore some of their properties.
Location: Bled, Slovenia
Address: Best Western Hotel Kompas Bled