1 problem

Let $G$ be a graph with maximum degree at most $3$, let $n$ be the number of vertices of $G$, and let $F(G)$ denote its forcing number. A $k$-parallel path graph is a graph of $k$-…