This cluster of papers represents advances in graph theory and algorithms, focusing on topics such as parameterized complexity, fixed-parameter algorithms, constraint satisfaction problems, treewidth, kernelization, complexity classification, approximation algorithms, and homomorphism. The papers cover a wide range of algorithmic applications and theoretical developments in the field of graph theory.