In a recent work, we introduced a parametric framework for obtaining obstruction characterizations of graph parameters with respect to a quasi-ordering $\leqslant$ on graphs. Towards this, we proposed the concepts of class obstruction, parametric obstruction, and universal obstruction as combinatorial objects that determine the approximate behaviour of a graph parameter. In this work, we explore its potential as a unifying framework for classifying graph parameters. Under this framework, we survey existing graph-theoretic results on many known graph parameters. Additionally, we provide some unifying results on their classification.

翻译：在近期工作中，我们提出了一个参数化框架，用于获得图参数相对于图类拟序关系 $\leqslant$ 的障碍特征刻画。为此，我们提出了类障碍、参数障碍和通用障碍的概念，这些组合对象决定了图参数的近似行为。本工作中，我们探讨了其作为图参数分类统一框架的潜力。在此框架下，我们综述了众多已知图参数的现有图论结果。此外，我们提供了关于其分类的一些统一性结论。