Treewidth of planar graphs: connections with duality
From MaRDI portal
Publication:3438941
DOI10.1016/S1571-0653(04)00353-1zbMath1171.05319OpenAlexW2031229603MaRDI QIDQ3438941
Frédéric Mazoit, Ioan Todinca, Vincent Bouchitte
Publication date: 29 May 2007
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s1571-0653(04)00353-1
Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
C-planarity testing of embedded clustered graphs with bounded dual carving-width ⋮ Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction
Cites Work