-
Tree depth, subgraph coloring and homomorphism bounds
We define the notions tree depth and upper chromatic number of a graph and show their relevance to local - global problems for graphs partitions. Particularly we show... -
Algorithmic Meta Theorems for Circuit Classes of Constant and Logarithmic Depth
International audience
