1. STORRE
  2. Faculty of Natural Sciences
  3. Computing Science and Mathematics
  4. Computing Science and Mathematics Journal Articles
Please use this identifier to cite or link to this item: http://hdl.handle.net/1893/25472
Full metadata record
DC FieldValueLanguage
dc.contributor.authorEnright, Jessicaen_UK
dc.contributor.authorStewart, Lornaen_UK
dc.contributor.authorTardos, Gaboren_UK
dc.date.accessioned2017-06-10T00:04:25Z-
dc.date.available2017-06-10T00:04:25Z-
dc.date.issued2014en_UK
dc.identifier.urihttp://hdl.handle.net/1893/25472-
dc.description.abstractList coloring is an NP-complete decision problem even if the total number of colors is three. It is hard even on planar bipartite graphs. We give a polynomial-time algorithm for solving list coloring of permutation graphs with a bounded total number of colors. More generally, we give a polynomial-time algorithm that solves the list-homomorphism problem to any fixed target graph for a large class of input graphs, including all permutation and interval graphs. en_UK
dc.language.isoenen_UK
dc.publisherSociety for Industrial and Applied Mathematicsen_UK
dc.relationEnright J, Stewart L & Tardos G (2014) On List Coloring and List Homomorphism of Permutation and Interval Graphs. SIAM Journal on Discrete Mathematics, 28 (4), pp. 1675-1685. https://doi.org/10.1137/13090465Xen_UK
dc.rightsPublisher policy allows this work to be made available in this repository. Published in SIAM J. Discrete Math., 28(4), 1675–1685 by Society for Industrial and Applied Mathematics. The original publication is available at: https://doi.org/10.1137/13090465Xen_UK
dc.subjecthomomorphismen_UK
dc.subjectinterval graphen_UK
dc.subjectpermutation graphen_UK
dc.subjectlist coloringen_UK
dc.titleOn List Coloring and List Homomorphism of Permutation and Interval Graphsen_UK
dc.typeJournal Articleen_UK
dc.identifier.doi10.1137/13090465Xen_UK
dc.citation.jtitleSIAM Journal on Discrete Mathematicsen_UK
dc.citation.issn1095-7146en_UK
dc.citation.issn0895-4801en_UK
dc.citation.volume28en_UK
dc.citation.issue4en_UK
dc.citation.spage1675en_UK
dc.citation.epage1685en_UK
dc.citation.publicationstatusPublisheden_UK
dc.citation.peerreviewedRefereeden_UK
dc.type.statusVoR - Version of Recorden_UK
dc.author.emailjae@cs.stir.ac.uken_UK
dc.citation.date09/10/2014en_UK
dc.contributor.affiliationMathematicsen_UK
dc.contributor.affiliationUniversity of Albertaen_UK
dc.contributor.affiliationAlfréd Rényi Institute of Mathematics of the Hungarian Academy of Sciencesen_UK
dc.identifier.isiWOS:000346844200003en_UK
dc.identifier.scopusid2-s2.0-84919912985en_UK
dc.identifier.wtid548616en_UK
dc.contributor.orcid0000-0002-0266-3292en_UK
dc.date.accepted2014-07-07en_UK
dcterms.dateAccepted2014-07-07en_UK
dc.date.filedepositdate2017-06-08en_UK
rioxxterms.apcnot requireden_UK
rioxxterms.typeJournal Article/Reviewen_UK
rioxxterms.versionVoRen_UK
local.rioxx.authorEnright, Jessica|0000-0002-0266-3292en_UK
local.rioxx.authorStewart, Lorna|en_UK
local.rioxx.authorTardos, Gabor|en_UK
local.rioxx.projectInternal Project|University of Stirling|https://isni.org/isni/0000000122484331en_UK
local.rioxx.freetoreaddate2017-06-08en_UK
local.rioxx.licencehttp://www.rioxx.net/licenses/all-rights-reserved|2017-06-08|en_UK
local.rioxx.filename90465.pdfen_UK
local.rioxx.filecount1en_UK
local.rioxx.source0895-4801en_UK
Appears in Collections:Computing Science and Mathematics Journal Articles

Files in This Item:
File Description SizeFormat 
90465.pdfFulltext - Published Version227.61 kBAdobe PDFView/Open


This item is protected by original copyright

View License
Show simple item record


Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.

The metadata of the records in the Repository are available under the CC0 public domain dedication: No Rights Reserved https://creativecommons.org/publicdomain/zero/1.0/

If you believe that any material held in STORRE infringes copyright, please contact library@stir.ac.uk providing details and we will remove the Work from public display in STORRE and investigate your claim.