2 problems

The affine upper-bound conjecture for sequential cable width
Let $G$ be a graph, let $\mathrm{lrw}(G)$ denote its linear rank-width, and let $\mathrm{lsfw}(G)$ denote its sequential cable width. Affine upper-bound conjecture. For every graph…
opengraph-theory linear-rank-width
0 responses
02
Kanté and Kwon's tree vertex-minor conjecture for linear rank-width
Kanté and Kwon's conjecture. For every tree $T$ , the class of $T$ -vertex-minor-free graphs has bounded linear rank-width.
opengraph-theory linear-rank-width vertex-minors
0 responses
03

The affine upper-bound conjecture for sequential cable width