4 problems

0 votes0 replies0 views
Kanté–Kwon conjecture on bounded linear rank-width of tree-vertex-minor-free graphs
Kanté–Kwon conjecture. For every tree $T$ , the class of $T$ -vertex-minor-free graphs has bounded linear rank-width.
Conjectureopengraph-width-parameters linear-rank-width vertex-minorsarXiv posted 2 days ago
0 votes0 replies1 view
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…
Conjectureopengraph-theory linear-rank-widtharXiv posted 2 days ago
0 votes0 replies0 views
Path pivot-minor conjecture for bounded linear rank-width
Path pivot-minor conjecture. For every path $P$ , the class of $P$ -pivot-minor-free graphs has bounded linear rank-width.
Problemopengraph-theory linear-rank-width pivot-minorsarXiv posted 2 days ago
0 votes0 replies0 views
Caterpillar pivot-minor conjecture for linear rank-width
Caterpillar pivot-minor conjecture. For every caterpillar $T$ , the class of $T$ -pivot-minor-free graphs has bounded linear rank-width.
Conjectureopengraph-theory linear-rank-width pivot-minorsarXiv posted 2 days ago

Kanté–Kwon conjecture on bounded linear rank-width of tree-vertex-minor-free graphs