Operations Which Preserve Path-Width at Most Two

DOI10.1017/S0963548301004709zbMath0986.05086OpenAlexW2313912268MaRDI QIDQ2757072

János Barát, Péter Hajnal

Publication date: 3 June 2002

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548301004709

zbMATH Keywords

minorwidthpath decomposition

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Structural characterization of families of graphs (05C75) Graph minors (05C83)

Related Items (1)

Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2

This page was built for publication: Operations Which Preserve Path-Width at Most Two