Tight Bounds on 1-Harmonious Coloring of Certain Graphs
暂无分享,去创建一个
[1] L. xilinx Wang,et al. The Local Harmonious Chromatic Problem ∗ Yue – , 2010 .
[2] Keith J. Edwards. Harmonious chromatic number of directed graphs , 2013, Discret. Appl. Math..
[3] Colin McDiarmid,et al. New upper bounds on harmonious colorings , 1994, J. Graph Theory.
[4] Junming Xu. Topological Structure and Analysis of Interconnection Networks , 2002, Network Theory and Applications.
[5] John E. Hopcroft,et al. On the Harmonious Coloring of Graphs , 1983 .
[6] Dan Pritikin,et al. The harmonious coloring number of a graph , 1991, Discret. Math..
[7] John Mitchem,et al. An upper bound for the harmonious chromatic number of a graph , 1987, J. Graph Theory.
[8] K. Balasubramanian,et al. Analytical expressions for topological properties of polycyclic benzenoid networks , 2016 .
[9] Ilia Krasikov,et al. Bounds for the harmonious chromatic number of a graph , 1994, J. Graph Theory.
[10] 高炜 高炜. Three algorithms for graph locally harmonious colouring , 2015 .
[11] John P. Georges. On the harmonious coloring of collections of graphs , 1995, J. Graph Theory.
[12] Colin McDiarmid,et al. Upper bounds for harmonious colorings , 1991, J. Graph Theory.
[13] Saieed Akbari,et al. On The Harmonious Colouring of Trees , 2016, Ars Comb..
[14] K. Appel,et al. Every Planar Map Is Four Colorable , 2019, Mathematical Solitaires & Games.