It is shown that the pathwidth of a cograph equals its treewidth, and a linear time algorithm to determine the pathwidth of a cograph and build a corresponding path-decomposition is given.MSC codes05C0505C8568R10Keywordsgraph algorithmscographstreewidthpathwidth
No takes yet. Share an insight, caveat, or question.
Bodlaender et al. (1993) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: