8 problems

A stack layout assigns edges to stacks so that no two edges in the same stack cross with respect to a vertex order, while a queue layout assigns edges to queues so that no two edge…

For a graph $G$, a queue layout is a linear ordering of $V(G)$ together with a partition of $E(G)$ into queues such that no two edges in the same queue are nested; the queue-number…

Forbidden-pattern characterization conjecture. The ordered matching admits

Critical matching enumeration conjecture. Based on computational experiments, for $k=1$ there are exactly eight critical matchings, while for $s=q=1$ there are exactly twelve criti…

CT conjecture. The Graycode numbering gives $\mathrm{ccw}(Q_n)$; equivalently, it attains the minimum cyclic cutwidth of $Q_n$.

Let $G$ be an undirected planar graph, and let $\operatorname{sn}(G)$ denote its stack number. Bernhart and Kainen's conjecture. There exist planar graphs with arbitrarily large st…

Let $G$ be a directed acyclic $2$-tree, and let $\operatorname{sn}(G)$ denote its stack number. Bekos et al.'s conjecture. The stack number of all directed acyclic $2$-trees is bou…

Let $G$ be a directed acyclic outerplanar graph, and let $\operatorname{sn}(G)$ denote its stack number. Heath, Pemmaraju and Trenk's conjecture. The stack number of the class of d…