Skip to content
DraconiticResearch
Search Sources API
186,541 studies31 sourcesUpdated 8 min ago
Peer-reviewedLicence not statedDiscrete Applied Mathematics

An overview of universal obstructions for graph parameters

Related

  1. Local Fan-type obstructions and Ore-type conditions for rainbow Hamiltonicity in graph systems
    Ailian Chen, Hao Chen
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  2. Support-Graph Reachability and Matrix-Composition Obstructions
    WuJun Chen
    Zenodo (CERN European Organization for Nuclear Research)PreprintCC BY7 citedCombinatorics & discrete mathematicsOpenAlex
  3. Maximizing the discrepancy between zero forcing parameters relative to graph order
    Andrew McKay, Allie Ray, Jonathan Valliere
    arXivPreprintCC BY-NC-SA 4.0Full textCombinatorics & discrete mathematicsarXiv
  4. Nonexistence of a Strongly Regular Graph with Parameters (266,45,0,9): A Certificate-Free Lean Proof
    Kay Akiyama
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  5. Mixed partition functions are exactly the graph parameters of exponentially bounded edge-connection rank
    William Whistler
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
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  -