List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Adding evidence to the Erdős-Faber-Lovász conjecture | 2011-02-02 | Paper |
| The Erdős-Faber-Lovász conjecture for dense hypergraphs Discrete Mathematics | 2008-02-14 | Paper |
| Advances on the Erdős-Faber-Lovász conjecture | 2007-06-28 | Paper |
| A new upper bound for total colourings of graphs Discrete Mathematics | 1995-10-26 | Paper |
| Total colouring regular bipartite graphs is NP-hard Discrete Mathematics | 1994-06-28 | Paper |
| An upper bound for total colouring of graphs Discrete Mathematics | 1994-04-25 | Paper |
| Determining the total colouring number is NP-hard Discrete Mathematics | 1989-01-01 | Paper |
Research outcomes over time
This page was built for person: Abdón Sánchez-Arroyo
