Author:
Akbari Saieed,Kim Jaehoon,Kostochka Alexandr
Funder
IPM
Arnold O. Beckman Research Award of the University of Illinois at Urbana-Champaign
NSF
Russian Foundation for Basic Research
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference4 articles.
1. On harmonious colouring of trees;Aflaki;Electron. J. Combin.,2012
2. The complexity of harmonious colouring for trees;Edwards;Discrete Appl. Math.,1995
3. The line-distinguishing chromatic number of a graph;Frank;Ars Combin.,1982
4. On the harmonious coloring of graphs;Hopcroft;SIAM J. Alg. Disc. Math.,1983
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Harmonious colourings of graphs;Discrete Applied Mathematics;2017-01
2. Harmonious coloring of uniform hypergraphs;Applicable Analysis and Discrete Mathematics;2016
3. Three algorithms for graph locally harmonious colouring;Journal of Difference Equations and Applications;2015-12-30
4. A Note on Harmonious Coloring of Caterpillars;IEICE Transactions on Information and Systems;2015