How to efficiently represent a graph in computer memory is a fundamental...
Functionality is a graph complexity measure that extends a variety of
pa...
For two graphs G_1 and G_2 on the same vertex set [n]:={1,2, …,
n}, and ...
We prove that the tree-width of graphs in a hereditary class defined by ...
The maximum independent set problem is known to be NP-hard in the class ...
It is known that a positive Boolean function f depending on n variables ...
In this paper, we reveal an intriguing relationship between two seemingl...