List 3-coloring Pt-free graphs with no induced 1-subdivision of K1,s
| dc.contributor.author | Chudnovsky, Maria | |
| dc.contributor.author | Spirkl, Sophie | |
| dc.contributor.author | Zhong, Mingxian | |
| dc.date.accessioned | 2022-08-12 01:07:56 (GMT) | |
| dc.date.available | 2022-08-12 01:07:56 (GMT) | |
| dc.date.issued | 2020-11 | |
| dc.identifier.uri | https://doi.org/10.1016/j.disc.2020.112086 | |
| dc.identifier.uri | http://hdl.handle.net/10012/18525 | |
| dc.description | The final publication is available at Elsevier via https://doi.org/10.1016/j.disc.2020.112086 © 2020. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/ | en |
| dc.description.abstract | Let s and t be positive integers. We use Pt to denote the path with t vertices and K1,s to denote the complete bipartite graph with parts of size 1 and s respectively. The one-subdivision of K1,s is obtained by replacing every edge {u, v} of K1,s by two edges {u, v} and {u, v} with a new vertex w. In this paper, we give a polynomial-time algorithm for the list 3-coloring problem restricted to the class of Pt-free graph with no induced 1-subdivision of K1,s. | en |
| dc.description.sponsorship | This paper is partially supported by National Science Foundation, United States of America grant DMS-1763817, U.S. Army Research Office grant W911NF-16-1-0404 and PSC-CUNY Award 3407-00 51, and is based upon work supported by the National Science Foundation, United States of America under Award No. DMS-1802201. | en |
| dc.language.iso | en | en |
| dc.publisher | Elsevier | en |
| dc.rights | Attribution-NonCommercial-NoDerivatives 4.0 International | * |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | * |
| dc.subject | coloring | en |
| dc.subject | forbidden induced subgraphs | en |
| dc.subject | dominating set | en |
| dc.title | List 3-coloring Pt-free graphs with no induced 1-subdivision of K1,s | en |
| dc.type | Article | en |
| dcterms.bibliographicCitation | Chudnovsky, M., Spirkl, S., & Zhong, M. (2020). List 3-coloring Pt-free graphs with no induced 1-subdivision of K1,s. Discrete Mathematics, 343(11), 112086. https://doi.org/10.1016/j.disc.2020.112086 | en |
| uws.contributor.affiliation1 | Faculty of Mathematics | en |
| uws.contributor.affiliation2 | Combinatorics and Optimization | en |
| uws.typeOfResource | Text | en |
| uws.peerReviewStatus | Reviewed | en |
| uws.scholarLevel | Faculty | en |
Files in this item
This item appears in the following Collection(s)
Except where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivatives 4.0 International