Planar L-Drawings of Bimodal Graphs

Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingAcademicpeer-review


In a planar l-drawing of a directed graph (digraph) each edge e is represented as a polyline composed of a vertical segment starting at the tail of e and a horizontal segment ending at the head of e. Distinct edges may overlap, but not cross. Our main focus is on bimodal graphs, i.e., digraphs admitting a planar embedding in which the incoming and outgoing edges around each vertex are contiguous. We show that every plane bimodal graph without 2-cycles admits a planar l-drawing. This includes the class of upward-plane graphs. Finally, outerplanar digraphs admit a planar l-drawing – although they do not always have a bimodal embedding – but not necessarily with an outerplanar embedding.keywordsplanar l-drawingsdirected graphsbimodality.
Original languageEnglish
Title of host publicationGraph Drawing and Network Visualization. GD 2020
EditorsDavid Auber, Pavel Valtr
PublisherSpringer, Cham
ISBN (Electronic)978-3-030-68766-3
ISBN (Print)978-3-030-68765-6
Publication statusPublished - 2021
Event28th International Symposium on Graph Drawing and Network Visualization - Online, Vancouver, Canada
Duration: 16 Sept 202018 Sept 2020
Conference number: 28th

Publication series

SeriesLecture Notes in Computer Science


Symposium28th International Symposium on Graph Drawing and Network Visualization
Abbreviated titleGraph Drawing
Internet address

Cite this