A mixed s-stack q-queue layout of a graph consists linear order its vertices and partition edges into s stacks q queues, such that no two in the same stack cross queue nest. In 1992, Heath Rosenberg conjectured every planar admits 1-stack 1-queue layout. Recently, Pupyrev disproved this by demonstrating partial 3-tree does not admit note, we strengthen Pupyrev's result showing conjecture hold e...