2 problems

Layered-tree-width weak-diameter conjecture. For every positive integer $w$, there exists a positive integer $N$ such that every graph with layered tree-width at most $w$ is 3-choo…

Layered-tree-width choosability conjecture. For every pair of positive integers $w$ and $\Delta$, there exists a positive integer $N$ such that every graph with layered tree-width…