Peer-reviewedLicence not statedDiscrete Applied Mathematics
An overview of universal obstructions for graph parameters
Related
- Local Fan-type obstructions and Ore-type conditions for rainbow Hamiltonicity in graph systems
- Support-Graph Reachability and Matrix-Composition Obstructions
- Maximizing the discrepancy between zero forcing parameters relative to graph order
- Nonexistence of a Strongly Regular Graph with Parameters (266,45,0,9): A Certificate-Free Lean Proof
- Mixed partition functions are exactly the graph parameters of exponentially bounded edge-connection rank
BibTeX
@article{paul2026overview,
title = {{An overview of universal obstructions for graph parameters}},
author = {Christophe Paul and Evangelos Protopapas and Dimitrios M. Thilikos},
journal = {Discrete Applied Mathematics},
year = {2026},
month = oct,
doi = {10.1016/j.dam.2026.05.029},
eprint = {2304.14121},
archivePrefix = {arXiv},
url = {https://hal.science/hal-05842159v1},
}
RIS
TY - JOUR
TI - An overview of universal obstructions for graph parameters
AU - Christophe Paul
AU - Evangelos Protopapas
AU - Dimitrios M. Thilikos
PY - 2026
DA - 2026/10/28
JO - Discrete Applied Mathematics
DO - 10.1016/j.dam.2026.05.029
UR - https://hal.science/hal-05842159v1
SN - 0166-218X
ER -