DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, Jaehoon | ko |
dc.contributor.author | Ok, Seongmin | ko |
dc.date.accessioned | 2019-07-18T05:34:08Z | - |
dc.date.available | 2019-07-18T05:34:08Z | - |
dc.date.created | 2019-07-17 | - |
dc.date.created | 2019-07-17 | - |
dc.date.created | 2019-07-17 | - |
dc.date.issued | 2018-03 | - |
dc.identifier.citation | JOURNAL OF GRAPH THEORY, v.87, no.3, pp.347 - 355 | - |
dc.identifier.issn | 0364-9024 | - |
dc.identifier.uri | http://hdl.handle.net/10203/263341 | - |
dc.description.abstract | Ther-dynamic choosability of a graph G, written ch(r) (G), is the least k such that whenever each vertex is assigned a list of at least k colors a proper coloring can be chosen from the lists so that every vertex v has at least min{d(G) (v), r} neigh-bors of distinct colors. Let ch(G) denote the choice number of G. In this article, we prove ch(r)(G) <= (1 + o(1)) ch(G) when Delta(G)/delta(G) is bounded. We also show that there exists a constant.. such that the random graph G = G (n, p) with 6log(n)/n < p <= 1/2 almost surely ch(2()G) <= ch(G) + C. Also if G is a triangle-free regular graph, then we have ch(2()G) <= ch(G) + 86. | - |
dc.language | English | - |
dc.publisher | WILEY | - |
dc.title | Dynamic choosability of triangle-free graphs and sparse random graphs | - |
dc.type | Article | - |
dc.identifier.wosid | 000428550700007 | - |
dc.identifier.scopusid | 2-s2.0-85021424146 | - |
dc.type.rims | ART | - |
dc.citation.volume | 87 | - |
dc.citation.issue | 3 | - |
dc.citation.beginningpage | 347 | - |
dc.citation.endingpage | 355 | - |
dc.citation.publicationname | JOURNAL OF GRAPH THEORY | - |
dc.identifier.doi | 10.1002/jgt.22161 | - |
dc.contributor.localauthor | Kim, Jaehoon | - |
dc.contributor.nonIdAuthor | Ok, Seongmin | - |
dc.description.isOpenAccess | N | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | dynamic choosability | - |
dc.subject.keywordAuthor | dynamic coloring | - |
dc.subject.keywordAuthor | dynamic list coloring | - |
dc.subject.keywordAuthor | strong coloring | - |
dc.subject.keywordPlus | CHROMATIC NUMBER | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.