DC Field | Value | Language |
---|---|---|
dc.contributor.author | Akbari, Saieed | ko |
dc.contributor.author | Kim, Jaehoon | ko |
dc.contributor.author | Kostochka, Alexandr | ko |
dc.date.accessioned | 2019-07-18T05:34:33Z | - |
dc.date.available | 2019-07-18T05:34:33Z | - |
dc.date.created | 2019-07-17 | - |
dc.date.created | 2019-07-17 | - |
dc.date.created | 2019-07-17 | - |
dc.date.issued | 2012-05 | - |
dc.identifier.citation | DISCRETE MATHEMATICS, v.312, no.10, pp.1633 - 1637 | - |
dc.identifier.issn | 0012-365X | - |
dc.identifier.uri | http://hdl.handle.net/10203/263355 | - |
dc.description.abstract | A harmonious coloring of G is a proper vertex coloring of G such that every pair of colors appears on at most one pair of adjacent vertices. The harmonious chromatic number of G, h(G), is the minimum number of colors needed for a harmonious coloring of G. We show that if T is a forest of order n with maximum degree Delta(T) >= n+2/3, then h(T) = {Delta(T) + 2, if T has non-adjacent vertices of degree Delta(T); Delta(T) + 1, otherwise. Moreover, the proof yields a polynomial-time algorithm for an optimal harmonious coloring of such a forest. (C) 2012 Elsevier B.V. All rights reserved. | - |
dc.language | English | - |
dc.publisher | ELSEVIER SCIENCE BV | - |
dc.title | Harmonious coloring of trees with large maximum degree | - |
dc.type | Article | - |
dc.identifier.wosid | 000303288500006 | - |
dc.identifier.scopusid | 2-s2.0-84862780556 | - |
dc.type.rims | ART | - |
dc.citation.volume | 312 | - |
dc.citation.issue | 10 | - |
dc.citation.beginningpage | 1633 | - |
dc.citation.endingpage | 1637 | - |
dc.citation.publicationname | DISCRETE MATHEMATICS | - |
dc.identifier.doi | 10.1016/j.disc.2012.02.009 | - |
dc.contributor.localauthor | Kim, Jaehoon | - |
dc.contributor.nonIdAuthor | Akbari, Saieed | - |
dc.contributor.nonIdAuthor | Kostochka, Alexandr | - |
dc.description.isOpenAccess | N | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | Harmonious coloring | - |
dc.subject.keywordAuthor | Tree | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.