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$获取图参量的障碍刻画。为此，我们提出了类障碍、参数化障碍和通用障碍等概念，将其作为决定图参量近似行为的组合对象。本文探索了该框架作为图参量分类统一框架的潜力，并在此框架下综述了关于多种已知图参量的现有图论结果。此外，我们还给出了关于其分类的一些统一性结论。