Hamilton cycles in sparse locally connected graphs

Show simple item record

dc.contributor.author Van Aardt, Susan A.
dc.contributor.author Burger, Alewyn Pierre
dc.contributor.author Frick, Marietjie
dc.contributor.author Thomassen, Carsten
dc.contributor.author De Wet, J.P. (Johan)
dc.date.accessioned 2018-12-10T12:35:56Z
dc.date.issued 2019-03
dc.description.abstract Please read abstract in the article. en_ZA
dc.description.department Mathematics and Applied Mathematics en_ZA
dc.description.embargo 2020-03-31
dc.description.librarian hj2018 en_ZA
dc.description.sponsorship The DST-NRF Centre of Excellence in Mathematical and Statistical Sciences (CoE-MaSS). First author was supported by the National Research Foundation of S.A., Grant number 81075. Second author was supported by the National Research Foundation of S.A. , Grant number 103832. Third author was supported by the National Research Foundation of S.A. , Grant number 107668. Fourth author was supported by ERC Advanced Grant GRACOL. en_ZA
dc.description.uri http://www.elsevier.com/locate/dam en_ZA
dc.identifier.citation Van Aardt, S.A., Burger, A.P., Frick, M. et al. 2019, 'Hamilton cycles in sparse locally connected graphs', Discrete Applied Mathematics, vol. 57, pp. 276-288. en_ZA
dc.identifier.issn 0166-218X (print)
dc.identifier.issn 1872-6771 (online)
dc.identifier.other 10.1016/j.dam.2018.10.031
dc.identifier.uri http://hdl.handle.net/2263/68078
dc.language.iso en en_ZA
dc.publisher Elsevier en_ZA
dc.rights © 2018 Elsevier B.V. All rights reserved. Notice : this is the author’s version of a work that was accepted for publication in Discrete Applied Mathematics. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. A definitive version was subsequently published in Discrete Applied Mathematics, vol. 57, pp. 276-288, 2019. doi : 10.1016/j.dam.2018.10.031. en_ZA
dc.subject Hamiltonian en_ZA
dc.subject Locally connected en_ZA
dc.subject NP-complete en_ZA
dc.subject Polynomial time algorithm en_ZA
dc.subject Polynomial approximation en_ZA
dc.subject Connected graph en_ZA
dc.subject Hamilton cycle en_ZA
dc.subject Natural number en_ZA
dc.subject Neighbourhood en_ZA
dc.subject Polynomially solvable en_ZA
dc.subject Graph theory en_ZA
dc.title Hamilton cycles in sparse locally connected graphs en_ZA
dc.type Postprint Article en_ZA


Files in this item

This item appears in the following Collection(s)

Show simple item record