Layered Fan-Planar Graph Drawings

Therese C. Biedl, Steven Chaplick, Kaufmann Michael, Fabrizio Montecchiani, Martin Nöllenburg, Chrysanthi N. Raftopoulou

Research output: Chapter in Book/Report/Conference proceedingChapterAcademic


In a fan-planar drawing of a graph an edge can cross only edges with a common end-vertex. In this paper, we study fan-planar drawings that use h (horizontal) layers and are proper, i.e., edges connect adjacent layers. We show that if the embedding of the graph is fixed, then testing the existence of such drawings is fixed-parameter tractable in h, via a reduction to a similar result for planar graphs by Dujmović et al. If the embedding is not fixed, then we give partial results for h = 2: It was already known how to test the existence of fan-planar proper 2-layer drawings for 2-connected graphs, and we show here how to test this for trees. Along the way, we exhibit other interesting results for graphs with a fan-planar proper h-layer drawing; in particular we bound their pathwidth and show that they have a bar-1-visibility representation.

Original languageEnglish
Title of host publication45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)
EditorsJavier Esparza, Daniel Kral
Place of PublicationDagstuhl, Germany
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Print)978-3-95977-159-7
Publication statusPublished - 2020
Event45th International Symposium on Mathematical Foundations of Computer Science - Online, Prague, Czech Republic
Duration: 24 Aug 202028 Aug 2020
Conference number: 45

Publication series

SeriesLeibniz International Proceedings in Informatics (LIPIcs)


Symposium45th International Symposium on Mathematical Foundations of Computer Science
Abbreviated titleMFCS 2020
Country/TerritoryCzech Republic
Internet address

Cite this