  Layered pathwidth is a new graph parameter studied by Bannister et al (2015).
In this paper we present two new results relating layered pathwidth to two
types of linear layouts. Our first result shows that, for any graph $G$, the
stack number of $G$ is at most four times the layered pathwidth of $G$. Our
second result shows that any graph $G$ with track number at most three has
layered pathwidth at most four. The first result complements a result of
Dujmovi\'c and Frati (2018) relating layered treewidth and stack number. The
second result solves an open problem posed by Bannister et al (2015).
