All Questions

For any $k$, the class of graphs of treewidth at most $k$ can be characterized by a finite set of forbidden minors. For treewidth $1$ and $2$, the set is of size $1$. Then for treewidth $3$, the set ...

I suspect this exists, if anyone has a reference please that would be very helpful. By signed graph, I mean each edge is designated either odd or even (e.g. as in Guenin's result for weakly bipartite ...

Let $bw(G)$ be the branchwidth of graph $G$ and $\omega(G)$ be the size of maximum clique in $G$. I think the following inequality holds: $$ \omega(G)\leq bw(G) $$ Intuition: Assume (in reverse of ...

Are there any good algebraic/algorithmic tools available to check if a given graph $H$ is a minor of $G$ from the adjacency matrix of $G$?