2026-07-17T14:40:46Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:25035 2026-02-09T07:53:56Z ddc:004 open_access

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 Linear layouts stack layouts queue layouts defective layouts 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Michael A. Bekos and Carla Binucci and Emilio Di Giacomo and Walter Didimo and Luca Grilli and Maria Eleni Pavlidi and Alessandra Tappini and Alexandra Weinberger 2025 Is Part Of LIPIcs, Volume 357, 33rd International Symposium on Graph Drawing and Network Visualization (GD 2025) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.GD.2025.49 urn:nbn:de:0030-drops-250350 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.GD.2025.49 eng https://creativecommons.org/licenses/by/4.0/legalcode