Turning Cliques into Paths to Achieve Planarity

Patrizio Angelini, Peter Eades, Seok-Hee Hong +5

Motivated by hybrid graph representations, we introduce and study the following beyond-planarity problem, which we call $h$-Clique2Path Planarity: Given a graph $G$, whose vertices…