Pathwidth Definition

In graph theory, the pathwidth of a graph is a parameter that measures how close the graph is to being a path graph. It is defined as one less than the width of a path decomposition of the graph, where a path decomposition is a sequence of subsets of the nodes such that every node of the graph is contained in at least one subset, and for every edge, the nodes of the edge are contained in consecutive subsets.