Defective Linear Layouts of Graphs (Poster Abstract)

Bekos, Michael A.; Binucci, Carla; Di Giacomo, Emilio; Didimo, Walter; Grilli, Luca; Pavlidi, Maria Eleni; Tappini, Alessandra; Weinberger, Alexandra

doi:10.4230/LIPIcs.GD.2025.49

Abstract

A linear layout of a graph defines a total order of the vertices and partitions the edges into either stacks or queues, i.e., crossing-free and non-nested sets of edges along the order, respectively. In this work, we study defective linear layouts that allow forbidden patterns among edges of the same set. Our focus is on k-defective stack layouts and k-defective queue layouts, in which the conflict graph representing the forbidden patterns among the edges of each stack or queue has maximum degree at most k.

Cite As Get BibTex

Michael A. Bekos, Carla Binucci, Emilio Di Giacomo, Walter Didimo, Luca Grilli, Maria Eleni Pavlidi, Alessandra Tappini, and Alexandra Weinberger. Defective Linear Layouts of Graphs (Poster Abstract). In 33rd International Symposium on Graph Drawing and Network Visualization (GD 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 357, pp. 49:1-49:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.GD.2025.49

Author Details

Michael A. Bekos

University of Ioannina, Greece

Carla Binucci

University of Perugia, Italy

Emilio Di Giacomo

University of Perugia, Italy

Walter Didimo

University of Perugia, Italy

Luca Grilli

University of Perugia, Italy

Maria Eleni Pavlidi

University of Ioannina, Greece

Alessandra Tappini

University of Perugia, Italy

Alexandra Weinberger

FernUniversität in Hagen, Germany

Funding

Bekos and Pavlidi were supported by HFRI Grant No: 26320.

Acknowledgements

Research started at the Bertinoro Workshop on Graph Drawing 2024.

References

Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann, and Sergey Pupyrev. The mixed page number of graphs. Theor. Comput. Sci., 931:131-141, 2022. URL: https://doi.org/10.1016/J.TCS.2022.07.036.
Michael A. Bekos, Martin Gronemann, and Chrysanthi N. Raftopoulou. An improved upper bound on the queue number of planar graphs. Algorithmica, 85(2):544-562, 2023. URL: https://doi.org/10.1007/s00453-022-01037-4.
Frank Bernhart and Paul C. Kainen. The book thickness of a graph. J. Comb. Theory, Ser. B, 27(3):320-331, 1979. URL: https://doi.org/10.1016/0095-8956(79)90021-2.
Vida Dujmović, Gwenaël Joret, Piotr Micek, Pat Morin, Torsten Ueckerdt, and David R. Wood. Planar graphs have bounded queue-number. J. ACM, 67(4):22:1-22:38, 2020. URL: https://doi.org/10.1145/3385731.
Lenwood S. Heath and Arnold L. Rosenberg. Laying out graphs using queues. SIAM J. Comput., 21(5):927-958, 1992. URL: https://doi.org/10.1137/0221055.
János Pach and Géza Tóth. Graphs drawn with few crossings per edge. Comb., 17(3):427-439, 1997. URL: https://doi.org/10.1007/BF01215922.
S. Rengarajan and C. E. Veni Madhavan. Stack and queue number of 2-trees. In Ding-Zhu Du and Ming Li, editors, Computing and Combinatorics, First Annual International Conference, COCOON '95, Xi'an, China, August 24-26, 1995, Proceedings, volume 959 of Lecture Notes in Computer Science, pages 203-212, 1995. URL: https://doi.org/10.1007/BFB0030834.
Bernardo M. Ábrego, Joseph Dandurand, Silvia Fernández-Merchant, Emilie Lagoda, and Yury Sapozhnikov. Book crossing numbers of the complete graph and small local convex crossing numbers. CoRR, abs/1607.00131, 2024. URL: https://arxiv.org/abs/1607.00131.

Defective Linear Layouts of Graphs (Poster Abstract)

Authors Michael A. Bekos , Carla Binucci , Emilio Di Giacomo , Walter Didimo , Luca Grilli , Maria Eleni Pavlidi , Alessandra Tappini , Alexandra Weinberger

File

Document Identifiers

Subject Classification

ACM Subject Classification

Keywords

Metrics

Abstract

Cite As Get BibTex

Author Details

Acknowledgements

References

Thanks for your feedback!

Could not send message