[2304.14121] An Overview of Universal Obstructions for Graph Parameters Skip to main content Search Submit Donate Log in Search arXiv Press Enter to search · Advanced search Computer Science > Discrete Mathematics arXiv:2304.14121 (cs) [Submitted on 27 Apr 2023 ( v1 ), last revised 30 Apr 2026 (this version, v3)] Title: An Overview of Universal Obstructions for Graph Parameters Authors: Christophe Paul , Evangelos Protopapas , Dimitrios M. Thilikos View a PDF of the paper titled An Overview of Universal Obstructions for Graph Parameters, by Christophe Paul and Evangelos Protopapas and Dimitrios M. Thilikos View PDF HTML (experimental) Abstract: 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. Subjects: Discrete Mathematics (cs.DM) ; Combinatorics (math.CO) MSC classes: 05C85, 05C83, 05C75 ACM classes: G.2.2 Cite as: arXiv:2304.14121 [cs.DM] (or arXiv:2304.14121v3 [cs.DM] for this version) https://doi.org/10.48550/arXiv.2304.14121 Focus to learn more arXiv-issued DOI via DataCite Submission history From: Dimitrios Thilikos [ view email ] [v1] Thu, 27 Apr 2023 12:13:46 UTC (1,241 KB) [v2] Fri, 6 Dec 2024 14:27:51 UTC (1,581 KB) [v3] Thu, 30 Apr 2026 18:42:46 UTC (1,556 KB) Full-text links: Access Paper: View a PDF of the paper titled An Overview of Universal Obstructions for Graph Parameters, by Christophe Paul and Evangelos Protopapas and Dimitrios M. Thilikos View PDF HTML (experimental) TeX Source view license Current browse context: cs.DM < prev | next > new | recent | 2023-04 Change to browse by: cs math math.CO References & Citations NASA ADS Google Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer ( What is the Explorer? ) Connected Papers Toggle Connected Papers ( What is Connected Papers? ) Litmaps Toggle Litmaps ( What is Litmaps? ) scite.ai Toggle scite Smart Citations ( What are Smart Citations? ) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv ( What is alphaXiv? ) Links to Code Toggle CatalyzeX Code Finder for Papers ( What is CatalyzeX? ) DagsHub Toggle DagsHub ( What is DagsHub? ) GotitPub Toggle Gotit.pub ( What is GotitPub? ) Huggingface Toggle Hugging Face ( What is Huggingface? ) ScienceCast Toggle ScienceCast ( What is ScienceCast? ) Demos Demos Replicate Toggle Replicate ( What is Replicate? ) Spaces Toggle Hugging Face Spaces ( What is Spaces? ) Spaces Toggle TXYZ.AI ( What is TXYZ.AI? ) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower ( What are Influence Flowers? ) Core recommender toggle CORE Recommender ( What is CORE? ) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs . Which authors of this paper are endorsers? | Disable MathJax ( What is MathJax? ) We gratefully acknowledge support from our major funders , member institutions , , and all contributors. About · Help · Contact · Subscribe · Copyright · Privacy · Accessibility · Operational Status (opens in new tab) Major funding support from