数学与计算机科学 |
|
|
|
|
完全二部图K 10, n (215 ≤ n ≤ 466)的点可区别E-全染色 |
包丽娅1, 陈祥恩1, 王治文2 |
1.西北师范大学 数学与统计学院, 甘肃兰州 730070 2.宁夏大学 数学统计学院, 宁夏银川 750021 |
|
Vertex-distinguishing E-total coloring of complete bipartite graph K 10, n with 215 ≤ n ≤ 466. |
BAO Liya1, CHEN Xiangen1, WANG Zhiwen2 |
1.College of Mathematics and Statistics, Northwest Normal University, Lanzhou 730070, China 2.College of Mathematics and Statistics, Ningxia University, Yinchuan 750021, China |
引用本文:
包丽娅, 陈祥恩, 王治文. 完全二部图K 10, n (215 ≤ n ≤ 466)的点可区别E-全染色[J]. 浙江大学学报(理学版), 2020, 47(1): 60-66.
BAO Liya, CHEN Xiangen, WANG Zhiwen. Vertex-distinguishing E-total coloring of complete bipartite graph K 10, n with 215 ≤ n ≤ 466.. Journal of Zhejiang University (Science Edition), 2020, 47(1): 60-66.
链接本文:
https://www.zjujournals.com/sci/CN/10.3785/j.issn.1008-9497.2020.01.008
或
https://www.zjujournals.com/sci/CN/Y2020/V47/I1/60
|
1 ZHANG Z F , QIU P X , LI J W , et al . Vertex-distinguishing total colorings of graphs[J]. Ars Combinatoria,2008, 87: 33-45.DOI:10.1007/s13369-011-0099-8 2 CHEN X E , GAO Y P , YAO B . Relations of vertex distinguishing total chromatic numbers between a subgraph and its supergraph[J]. Information Sciences, 2014, 288(1): 246-253. DOI:10.1016/j.ins.2014.08.016 3 辛小青,王治文,陈祥恩,等 . 点不交的 m 个 C 3 的并的点可区别全染色[J]. 吉林大学学报(理学版), 2012, 50(2): 251-257. XIN X Q , WANG Z W , CHEN X E , et al . Vertex distinguishing total chromatic number of m C 3 [J]. Journal of Jilin University( Science Edition), 2012, 50(2): 251-257. 4 陈祥恩, 王治文, 马彦荣, 等 . m K 4 的点可区别全染色[J]. 吉林大学学报(理学版), 2012, 50(4): 686-692. CHEN X E , WANG Z W , MA Y R , et al . Vertex-distinguishing total colorings of m K 4 [J]. Journal of Jilin University(Science Edition), 2012, 50(4): 686-692. 5 CHEN X E , ZU Y , XU J , et al . Vertex-distinguishing E-total colorings of graphs[J]. Arabian Journal for Science Engineering, 2011, 36(8): 1485-1500. DOI:10.1007/s13369-011-0099-8 6 CHEN X E , ZU Y . Vertex-distinguishing E-total coloring of the graphs m C 3 and m C 4 [J]. Journal of Mathematical Research & Exposition, 2011, 31(1):45-58. 7 李世玲, 陈祥恩, 王治文 . 完全二部图 K 3 , n ( 3 ≤ n ≤ 17 ) 的点可区别E-全染色[J]. 吉林大学学报(理学版), 2015, 53(6): 1171-1176. LI S L , CHEN X E , WANG Z W . Vertex-distinguishing E-total coloring of complete bipartite graph K 3 , n with 3 ≤ n ≤ 17 [J]. Journal of Jilin University( Science Edition), 2015, 53(6): 1171-176. 8 李世玲, 陈祥恩, 王治文 . 完全二部图 K 3 , n ( n ≥ 18 ) 的点可区别E-全染色[J]. 山东大学学报(理学版), 2015, 51(4): 68-71. LI S L , CHEN X E , WANG Z W . Vertex-distinguishing E-Total coloring of complete bipartite graph K 3 , n with n ≥ 18 [J]. Journal of Shandong University(Science Edition), 2015, 51(4): 68-71. 9 李世玲 . 完全二部图的点可区别E-全染色的若干结果[D]. 兰州:西北师范大学, 2017. LI S L . Some Results of Vertex-distinguishing E-Total Coloring of Complete Bipartite Graph[D]. Lanzhou: Northwest Normal University, 2017. 10 CHEN X E . Vertex-distinguishing E-Total coloring of complete bipartite graph K 7 , n when 7 ≤ n ≤ 95 [J]. Communications in Mathematical Research, 2016, 32(4): 359-374.DOI:10.13447/j.1674-5647.2016.04.08 11 包丽娅, 陈祥恩, 王治文 . 完全二部图 K 10 , n ( 10 ≤ n ≤ 90 ) 的点可区别E-全染色[J]. 山东大学学报(理学版), 2018, 53(12): 23-30. DOI:10.6040/j.issn.1671-9352.0.2018.605 BAO L Y , CHEN X E , WANG Z W . Vertex-distinguishing E-total coloring of complete bipartite graph K 10 , n when 10 ≤ n ≤ 90 [J]. Journal of Shandong University(Science Edition), 2018, 53(12): 23-30. DOI:10.13447/j.1674-5647.2016.04.08 12 陈祥恩,包丽娅 . 完全二部图 K 10 , n ( 91 ≤ n ≤ 214 ) 的点可区别E-全染色[J]. 兰州大学学报(自然科学版),2019,55(3):40-414. CHEN X E , BAO L Y .Vertex-distinguishing E-total coloring of complete bipartite graph K 10 , n when 91 ≤ n ≤ 214 [J]. Journal of Lanzhou University (Natural Science Edition),2019,55(3):410-414 |
|
Viewed |
|
|
|
Full text
|
|
|
|
|
Abstract
|
|
|
|
|
Cited |
|
|
|
|
|
Shared |
|
|
|
|
|
Discussed |
|
|
|
|