Dynamic programming on various graph decompositions is one of the most
f...
A trigraph is a graph where each pair of vertices is labelled either 0 (...
Tree-width and its linear variant path-width play a central role for the...
The graph parameter of pathwidth can be seen as a measure of the topolog...
We prove that one can count in polynomial time the number of minimal
tra...
In this paper, we combine the rank-based approach and the
neighbor-equiv...
Given a clique-width expression of a graph G of clique-width k, we provi...