2 papers
cs.CG2025
The Price of Connectivity Augmentation on Planar Graphs
Hugo A. Akitaya, Justin Dallant, Erik D. Demaine +5
Given two classes of graphs, , and a -connected graph , we wish to augment with a smallest cardinality set of new e…
math.CO2025
Transforming Stacks into Queues: Mixed and Separated Layouts of Graphs
Julia Katheder, Michael Kaufmann, Sergey Pupyrev +1
Some of the most important open problems for linear layouts of graphs ask for the relation between a graph's queue number and its stack number or mixed number. In such, we seek a v…