2 problems

Let $G$ be a graph, let $k$ be an integer, and let $G'$ be any $(\leqslant k)$-subdivision of $G$, obtained by replacing each edge of $G$ by an internally disjoint path with at mos…

Let $G$ be a graph, and let $H$ be a $(\leq 1)$-subdivision of $G$, obtained by subdividing each edge of $G$ at most once. Let $\operatorname{sn}(G)$ denote the stack number of $G$…