Mostra el registre d'ítem simple
On list k-coloring convex bipartite graphs
dc.contributor.author | Díaz Cort, Josep |
dc.contributor.author | Yasar Diner, Oznur |
dc.contributor.author | Serna Iglesias, María José |
dc.contributor.author | Serra Albó, Oriol |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Ciències de la Computació |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Matemàtiques |
dc.date.accessioned | 2021-03-08T14:43:47Z |
dc.date.available | 2021-11-09T01:31:58Z |
dc.date.issued | 2020 |
dc.identifier.citation | Diaz, J. [et al.]. On list k-coloring convex bipartite graphs. A: Cologne-Twente Workshop on Graphs and Combinatorial Optimization. "Graphs and Combinatorial Optimization: from Theory to Applications: CTW2020 proceedingss". Berlín: Springer, 2020, p. 15-26. ISBN 978-3-030-63071-3. DOI 10.1007/978-3-030-63072-0_2. |
dc.identifier.isbn | 978-3-030-63071-3 |
dc.identifier.uri | http://hdl.handle.net/2117/341144 |
dc.description.abstract | List k–Coloring (LI k-COL) is the decision problem asking if a given graph admits a proper coloring compatible with a given list assignment to its vertices with colors in {1,2,..., k}. The problem is known to be NP-hard even for k = 3 within the class of 3–regular planar bipartite graphs and for k = 4 within the class of chordal bipartite graphs. In 2015 Huang, Johnson and Paulusma asked for the complexity of LI 3-COL in the class of chordal bipartite graphs. In this paper, we give a partial answer to this question by showing that LI k-COL is polynomial in the class of convex bipartite graphs. We show first that biconvex bipartite graphs admit a multichain ordering, extending the classes of graphs where a polynomial algorithm of Enright, Stewart and Tardos (2014) can be applied to the problem. We provide a dynamic programming algorithm to solve the LI k-COL in the class of convex bipartite graphs. Finally, we show how our algorithm can be modified to solve the more general LI H-COL problem on convex bipartite graphs. |
dc.description.sponsorship | J. Díaz and M. Serna are partially supported by funds from MINECO and EU FEDER under grant TIN 2017-86727-C2-1-R AGAUR project ALBCOM 2017- SGR-786. O. Y. Diner is partially supported by the Scientific and Technological Research Council Tubitak under project BIDEB 2219-1059B191802095 and by Kadir Has University under project 2018-BAP-08. O. Serra is supported by the Spanish Ministry of Science under project MTM2017-82166-P. |
dc.format.extent | 12 p. |
dc.language.iso | eng |
dc.publisher | Springer |
dc.subject | Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica |
dc.subject.lcsh | Graph theory |
dc.subject.other | List coloring |
dc.subject.other | Convex bipartite |
dc.subject.other | Biconvex bipartite graphs |
dc.title | On list k-coloring convex bipartite graphs |
dc.type | Conference report |
dc.subject.lemac | Grafs, Teoria de |
dc.contributor.group | Universitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals |
dc.contributor.group | Universitat Politècnica de Catalunya. GAPCOMB - Geometric, Algebraic and Probabilistic Combinatorics |
dc.identifier.doi | 10.1007/978-3-030-63072-0_2 |
dc.description.peerreviewed | Peer Reviewed |
dc.relation.publisherversion | https://link.springer.com/chapter/10.1007%2F978-3-030-63072-0_2 |
dc.rights.access | Open Access |
local.identifier.drac | 30670064 |
dc.description.version | Postprint (author's final draft) |
dc.relation.projectid | info:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2013-2016/MTM2017-82166-P/ES/COMBINATORIA GEOMETRICA, ALGEBRAICA Y PROBABILISTICA/ |
dc.relation.projectid | info:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2013-2016/TIN2017-86727-C2-1-R/ES/MODELOS Y METODOS BASADOS EN GRAFOS PARA LA COMPUTACION EN GRAN ESCALA/ |
dc.relation.projectid | info:eu-repo/grantAgreement/AGAUR/2017 SGR 786 |
local.citation.author | Diaz, J.; Yasar, O.; Serna, M.; Serra, O. |
local.citation.contributor | Cologne-Twente Workshop on Graphs and Combinatorial Optimization |
local.citation.pubplace | Berlín |
local.citation.publicationName | Graphs and Combinatorial Optimization: from Theory to Applications: CTW2020 proceedingss |
local.citation.startingPage | 15 |
local.citation.endingPage | 26 |