Cookies

We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.


Durham Research Online
You are in:

Finding shortest paths between graph colourings.

Johnson, M. and Kratsch, D. and Kratsch, S. and Patel, V. and Paulusma, D. (2014) 'Finding shortest paths between graph colourings.', in 9th International Symposium, IPEC 2014, Wroclaw, Poland, 10-12 September 2014 ; revised selected papers. Berlin, Heidelberg: Springer, pp. 221-233. Lecture notes in computer science. (8894).


Item Type:Book chapter
Full text:(AM) Accepted Manuscript
Download PDF
(330Kb)
Status:Peer-reviewed
Publisher Web site:http://dx.doi.org/10.1007/978-3-319-13524-3_19
Publisher statement:The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-13524-3_19
Date accepted:No date available
Date deposited:16 January 2015
Date of first online publication:2014
Date first made open access:No date available

Save or Share this output

Export:
Export
Look up in GoogleScholar