Luis Cereceda

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 Jan van den Heuvel

> Home > Persons > Luis Cereceda

Publications

2011
[j5]
- view
  authority control:
- export record
  dblp key:
  - journals/jgt/CerecedaHJ11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jgt/CerecedaHJ11
Luis Cereceda, Jan van den Heuvel, Matthew Johnson:
Finding paths between 3-colorings. J. Graph Theory 67(1): 69-82 (2011)
2009
[j4]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/ejc/CerecedaHJ09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ejc/CerecedaHJ09
Luis Cereceda, Jan van den Heuvel, Matthew Johnson:
Mixing 3-colourings in bipartite graphs. Eur. J. Comb. 30(7): 1593-1606 (2009)
2008
[j2]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dm/CerecedaHJ08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/CerecedaHJ08
Luis Cereceda, Jan van den Heuvel, Matthew Johnson:
Connectedness of the graph of vertex-colourings. Discret. Math. 308(5-6): 913-919 (2008)
[c4]
- no documents available
  - no references & citations available
- export record
  dblp key:
  - conf/iwoca/JohnsonCH08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iwoca/JohnsonCH08
Matthew Johnson, Luis Cereceda, Jan van den Heuvel:
Finding Paths Between 3-Colourings. IWOCA 2008: 182-196
2007
[j1]
- view
  authority control:
- export record
  dblp key:
  - journals/endm/BonsmaCHJ07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/endm/BonsmaCHJ07
Paul S. Bonsma, Luis Cereceda, Jan van den Heuvel, Matthew Johnson:
Finding Paths between Graph Colourings: Computational Complexity and Possible Distances. Electron. Notes Discret. Math. 29: 463-469 (2007)
[c2]
- view
  authority control:
- export record
  dblp key:
  - conf/wg/CerecedaHJ07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wg/CerecedaHJ07
Luis Cereceda, Jan van den Heuvel, Matthew Johnson:
Mixing 3-Colourings in Bipartite Graphs. WG 2007: 166-177

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.