Improved upper bounds for planarization and series-parallelization of degree-bounded graphs

zbMath1243.05066MaRDI QIDQ426901

Keith J. Edwards, Graham E. Farr

Publication date: 12 June 2012

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.emis.de/journals/EJC/ojs/index.php/eljc/article/view/v19i2p25

zbMATH Keywords

tree widthplanarizationregular expressionfragmentabilityseries-parallel

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40) Vertex degrees (05C07)

Related Items (3)

A faster polynomial-space algorithm for Max 2-CSP ⋮ A general reduction theorem with applications to pathwidth and the complexity of Max 2-CSP ⋮ $K_4$-Minor-Free Induced Subgraphs of Sparse Connected Graphs

This page was built for publication: Improved upper bounds for planarization and series-parallelization of degree-bounded graphs