Answer by Corto for Tree decompositions with unique witness for each edge
I'm afraid the answer to both of your questions is no.Consider a graph $(V_n, E_n)$ with $V_n = \{1,...,n+2\}$ and $E = \{\{i,i+1\} | 1 \leq i \leq n+1\} \cup \{\{i,i+2\} \mid 1 \leq i \leq n\}$.This...
View ArticleTree decompositions with unique witness for each edge
In this question I am concerned with tree decompositions of undirected graphs. Recall that a tree decomposition of a graph $G = (V, E)$ is a tree $T$ whose nodes are subsets of $V$ (called bags)...
View Article
More Pages to Explore .....
