On the structure of graphs with path-width at most two

DOI10.1556/SScMath.49.2012.2.1200zbMath1289.05443arXiv0910.4889OpenAlexW2004788589MaRDI QIDQ2915439

Aifeng Yang, János Barát, Yanpei Liu, Péter Hajnal

Publication date: 17 September 2012

Published in: Studia Scientiarum Mathematicarum Hungarica (Search for Journal in Brave)

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

zbMATH Keywords

blockpath-widthexcluded minor

Mathematics Subject Classification ID

Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Graph minors (05C83)

Related Items (6)

Posets with cover graph of pathwidth two have bounded dimension ⋮ Characterizing width two for variants of treewidth ⋮ B0-VPG Representation of AT-free Outerplanar Graphs ⋮ On the geometric Ramsey number of outerplanar graphs ⋮ Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2 ⋮ Digraphs of Bounded Width

This page was built for publication: On the structure of graphs with path-width at most two