![]() |
@article{DBLP:journals/endm/BonsmaCHJ07,
author = {Paul S. Bonsma and
Luis Cereceda and
Jan van den Heuvel and
Matthew Johnson},
title = {Finding Paths between Graph Colourings: Computational Complexity
and Possible Distances},
journal = {Electronic Notes in Discrete Mathematics},
volume = {29},
year = {2007},
pages = {463-469},
ee = {http://dx.doi.org/10.1016/j.endm.2007.07.073},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Copyright © 2009-03-04 by Michael Ley (ley@uni-trier.de)