On Mixed Linear Layouts of SeriesParallel Graphs
Abstract
A mixed sstack qqueue layout of a graph consists of a linear order of its vertices and of a partition of its edges into s stacks and q queues, such that no two edges in the same stack cross and no two edges in the same queue nest. In 1992, Heath and Rosenberg conjectured that every planar graph admits a mixed 1stack 1queue layout. Recently, Pupyrev disproved this conjectured by demonstrating a planar partial 3tree that does not admit a 1stack 1queue layout. In this note, we strengthen Pupyrev's result by showing that the conjecture does not hold even for 2trees, also known as seriesparallel graphs.
 Publication:

arXiv eprints
 Pub Date:
 August 2020
 arXiv:
 arXiv:2008.10475
 Bibcode:
 2020arXiv200810475A
 Keywords:

 Computer Science  Discrete Mathematics
 EPrint:
 Appears in the Proceedings of the 28th International Symposium on Graph Drawing and Network Visualization (GD 2020)