Abdón Sánchez-Arroyo

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Colin McDiarmid

> Home > Persons > Abdón Sánchez-Arroyo

Publications

1994
[j3]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dm/McDiarmidS94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/McDiarmidS94
Colin J. H. McDiarmid, Abdón Sánchez-Arroyo:
Total colouring regular bipartite graphs is NP-hard. Discret. Math. 124(1-3): 155-162 (1994)
1993
[j2]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dm/McDiarmidS93
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/McDiarmidS93
Colin J. H. McDiarmid, Abdón Sánchez-Arroyo:
An upper bound for total colouring of graphs. Discret. Math. 111(1-3): 389-392 (1993)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.