Splitting \(B_2\)-VPG graphs into outer-string and co-comparability graphs

DOI10.1007/978-3-319-62127-2_14zbMath1491.68135arXiv1612.07276OpenAlexW2564857307MaRDI QIDQ2405283

Martin Derka, Therese C. Biedl

Publication date: 22 September 2017

Full work available at URL: https://arxiv.org/abs/1612.07276

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (1)

Computing maximum independent set on outerstring graphs and their relatives

This page was built for publication: Splitting \(B_2\)-VPG graphs into outer-string and co-comparability graphs