Tree-depth, subgraph coloring and homomorphism bounds

Abstract

We define tree depth of a graph, upper chromatic numberand show their relevance to local-global problems for graph partitions.

Keywords

• Tree-depth
• subgraph
• coloring
• homomorphism
• bounds