Florian Lehner

Three Obstructions Characterize Finite Path-Width in Countable Graphs

Structural exclusions yield a finite path-width criterion, while universal-host constructions separate line-width bounds from path-width guarantees.