Pathwidth of a graph

Pathwidth of a graph --- путевая ширина графа.

The minimum value [math]\displaystyle{ k }[/math] for which the graph is a partial [math]\displaystyle{ k }[/math]-path. The pathwidth of a graph [math]\displaystyle{ G }[/math] equals the minimum width over all path-decompositions of [math]\displaystyle{ G }[/math].