Abstract

In this paper we investigate both the structure of graphs with branchwidth at most three, as
well as algorithms to recognise such graphs. We show that a graph has branchwidth at most
three, if and only if it has treewidth at most three and does not contain the three-dimensional
binary cube graph as
... read more