In this paper we study syntactic branching programs of bounded repetition
representing CNFs of bounded treewidth.
For this purpose we introduce two new structural graph
parameters d-pathwidth and clique preserving d-pathwidth denoted
by pw_d(G) and cpw_d(G) where G is a graph.
We show that cpw_2(G) \leq O(tw(G) \Delta(G)) ... more >>>