2-distance Vertex-distinguishing Total Coloring of Graphs
暂无分享,去创建一个
[1] Haiying Wang,et al. On the adjacent vertex-distinguishing total chromatic numbers of the graphs with Δ (G) = 3 , 2007, J. Comb. Optim..
[2] Xiangen Chen. On the adjacent vertex distinguishing total coloring numbers of graphs with Delta=3 , 2008, Discret. Math..
[3] Ding-Zhu Du,et al. A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs , 2016, J. Glob. Optim..
[4] Tom Coker,et al. The adjacent vertex distinguishing total chromatic number , 2010, Discret. Math..
[5] Jiaao Li,et al. Adjacent vertex distinguishing total coloring of graphs with maximum degree 4 , 2017, Discret. Math..
[6] B. Yao,et al. On adjacent-vertex-distinguishing total coloring of graphs , 2005 .
[7] Bruce A. Reed,et al. A Bound on the Total Chromatic Number , 1998, Comb..
[8] Wei-Fan Wang,et al. The Adjacent Vertex Distinguishing Total Chromatic Number of Graphs , 2010, 2010 4th International Conference on Bioinformatics and Biomedical Engineering.