DC Field | Value | Language |
---|---|---|
dc.contributor.author | Choi, Ilkyoo | ko |
dc.contributor.author | Lidicky, Bernard | ko |
dc.contributor.author | Stolee, Derrick | ko |
dc.date.accessioned | 2016-06-07T08:53:59Z | - |
dc.date.available | 2016-06-07T08:53:59Z | - |
dc.date.created | 2016-02-12 | - |
dc.date.created | 2016-02-12 | - |
dc.date.issued | 2016-03 | - |
dc.identifier.citation | JOURNAL OF GRAPH THEORY, v.81, no.3, pp.283 - 306 | - |
dc.identifier.issn | 0364-9024 | - |
dc.identifier.uri | http://hdl.handle.net/10203/207610 | - |
dc.description.abstract | We study choosability with separation which is a constrained version of list coloring of graphs. A (k, d)-list assignment L of a graph G is a function that assigns to each vertex v a list L(v) of at least k colors and for any adjacent pair xy, the lists L(x) and L(y) share at most d colors. A graph G is (k, d)-choosable if there exists an L-coloring of G for every (k, d)-list assignment L. This concept is also known as choosability with separation. We prove that planar graphs without 4-cycles are (3, 1)-choosable and that planar graphs without 5- and 6-cycles are (3, 1)-choosable. In addition, we give an alternative and slightly stronger proof that triangle-free planar graphs are (3, 1)-choosable. (C) 2015 Wiley Periodicals, Inc | - |
dc.language | English | - |
dc.publisher | WILEY-BLACKWELL | - |
dc.subject | COLORINGS | - |
dc.title | On Choosability with Separation of Planar Graphs with Forbidden Cycles | - |
dc.type | Article | - |
dc.identifier.wosid | 000368132500005 | - |
dc.identifier.scopusid | 2-s2.0-84954361346 | - |
dc.type.rims | ART | - |
dc.citation.volume | 81 | - |
dc.citation.issue | 3 | - |
dc.citation.beginningpage | 283 | - |
dc.citation.endingpage | 306 | - |
dc.citation.publicationname | JOURNAL OF GRAPH THEORY | - |
dc.identifier.doi | 10.1002/jgt.21875 | - |
dc.contributor.nonIdAuthor | Lidicky, Bernard | - |
dc.contributor.nonIdAuthor | Stolee, Derrick | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordPlus | COLORINGS | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.