2-connecting Outerplanar Graphs without Blowing Up the Pathwidth

DOI10.1007/978-3-642-38768-5_55zbMath1382.68159arXiv1212.6382OpenAlexW2499156774MaRDI QIDQ4925277

Jasine Babu, Deepak Rajendraprasad, Sunil Chandran Leela, Manu Basavaraju

Publication date: 11 June 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

pathwidthouterplanar graphbi-connected

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

This page was built for publication: 2-connecting Outerplanar Graphs without Blowing Up the Pathwidth