1 problem

Let $G=(V,E,L)$ be a looped simple graph. For a positive integer $k$, let $G^{[k]}$ be the graph obtained by adding $k$ new loops at every vertex, and call $G$ $k$-tight if every v…