Planar L-Drawings of Bimodal Graphs

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

doi:10.1007/978-3-030-68766-3_17

Planar L-Drawings of Bimodal Graphs

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

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceeding › Academic › peer-review

Abstract

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 language	English
Title of host publication	Graph Drawing and Network Visualization. GD 2020
Editors	David Auber, Pavel Valtr
Publisher	Springer, Cham
Pages	205-219
Volume	12590
ISBN (Electronic)	978-3-030-68766-3
ISBN (Print)	978-3-030-68765-6
DOIs	https://doi.org/10.1007/978-3-030-68766-3_17
Publication status	Published - 2021
Event	28th International Symposium on Graph Drawing and Network Visualization - Online, Vancouver, Canada Duration: 16 Sept 2020 → 18 Sept 2020 Conference number: 28th https://gd2020.cs.ubc.ca/

Publication series

Series	Lecture Notes in Computer Science
Volume	12590
ISSN	0302-9743

Symposium

Symposium	28th International Symposium on Graph Drawing and Network Visualization
Abbreviated title	Graph Drawing
Country/Territory	Canada
City	Vancouver
Period	16/09/20 → 18/09/20
Internet address	https://gd2020.cs.ubc.ca/

Access to Document

10.1007/978-3-030-68766-3_17

https://dblp.org/rec/conf/gd/AngeliniCCL20

1 Article
1 Preprint

Planar L-Drawings of Bimodal Graphs
Angelini, P., Chaplick, S., Cornelsen, S. & Lozzo, G. D., 2022, In: Journal of Graph Algorithms and Applications. 26, 3, p. 307-334
Research output: Contribution to journal › Article › Academic › peer-review

Open Access
Planar L-Drawings of Bimodal Graphs
Angelini, P., Chaplick, S., Cornelsen, S. & Lozzo, G. D., 2020, 28 p.
Research output: Working paper / Preprint › Preprint

Cite this

@inproceedings{07e86426c4ec4df3a46beb08cbdc3436,

title = "Planar L-Drawings of Bimodal Graphs",

abstract = "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.",

author = "Patrizio Angelini and Steven Chaplick and Sabine Cornelsen and Lozzo, {Giordano Da}",

note = "DBLP's bibliographic metadata records provided through http://dblp.org/search/publ/api are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.; 28th International Symposium on Graph Drawing and Network Visualization , Graph Drawing ; Conference date: 16-09-2020 Through 18-09-2020",

year = "2021",

doi = "10.1007/978-3-030-68766-3_17",

language = "English",

isbn = "978-3-030-68765-6",

volume = "12590",

series = "Lecture Notes in Computer Science",

publisher = "Springer, Cham",

pages = "205--219",

editor = "David Auber and Pavel Valtr",

booktitle = "Graph Drawing and Network Visualization. GD 2020",

address = "Switzerland",

url = "https://gd2020.cs.ubc.ca/",

}

Angelini, P, Chaplick, S, Cornelsen, S & Lozzo, GD 2021, Planar L-Drawings of Bimodal Graphs. in D Auber & P Valtr (eds), Graph Drawing and Network Visualization. GD 2020. vol. 12590, Springer, Cham, Lecture Notes in Computer Science, vol. 12590, pp. 205-219, 28th International Symposium on Graph Drawing and Network Visualization , Vancouver, Canada, 16/09/20. https://doi.org/10.1007/978-3-030-68766-3_17

Planar L-Drawings of Bimodal Graphs. / Angelini, Patrizio; Chaplick, Steven; Cornelsen, Sabine et al.
Graph Drawing and Network Visualization. GD 2020. ed. / David Auber; Pavel Valtr. Vol. 12590 Springer, Cham, 2021. p. 205-219 (Lecture Notes in Computer Science, Vol. 12590).

Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceeding › Academic › peer-review

TY - GEN

T1 - Planar L-Drawings of Bimodal Graphs

AU - Angelini, Patrizio

AU - Chaplick, Steven

AU - Cornelsen, Sabine

AU - Lozzo, Giordano Da

N1 - Conference code: 28th

PY - 2021

Y1 - 2021

N2 - 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.

AB - 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.

U2 - 10.1007/978-3-030-68766-3_17

DO - 10.1007/978-3-030-68766-3_17

M3 - Conference article in proceeding

SN - 978-3-030-68765-6

VL - 12590

T3 - Lecture Notes in Computer Science

SP - 205

EP - 219

BT - Graph Drawing and Network Visualization. GD 2020

A2 - Auber, David

A2 - Valtr, Pavel

PB - Springer, Cham

T2 - 28th International Symposium on Graph Drawing and Network Visualization

Y2 - 16 September 2020 through 18 September 2020

ER -

Planar L-Drawings of Bimodal Graphs

Abstract

Publication series

Symposium

Access to Document

Fingerprint

Research output