Abdón Sánchez-Arroyo
From MaRDI portal
Person:686498
Available identifiers
zbMath Open sanchez-arroyo.abdonMaRDI QIDQ686498
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 |
|---|---|---|
| https://portal.mardi4nfdi.de/entity/Q3070194 | 2011-02-02 | Paper |
| The Erdős-Faber-Lovász conjecture for dense hypergraphs | 2008-02-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3447292 | 2007-06-28 | Paper |
| A new upper bound for total colourings of graphs | 1995-10-26 | Paper |
| Total colouring regular bipartite graphs is NP-hard | 1994-06-28 | Paper |
| An upper bound for total colouring of graphs | 1994-04-25 | Paper |
| Determining the total colouring number is NP-hard | 1989-01-01 | Paper |
Research outcomes over time
This page was built for person: Abdón Sánchez-Arroyo
