K4,4,p的點(diǎn)可區(qū)別的IE-全染色(p≥1008)

陳祥恩; 馬靜靜

doi:10.11999/SEIT190832

K_4,4,p的點(diǎn)可區(qū)別的IE-全染色(p≥1008)

doi: 10.11999/SEIT190832

陳祥恩^,,
馬靜靜

西北師范大學(xué)數(shù)學(xué)與統(tǒng)計學(xué)院蘭州 730070

基金項(xiàng)目: 國家自然科學(xué)基金(11761064, 61163037)

詳細(xì)信息

作者簡介:
陳祥恩：男，1965年生，教授，主要研究方向?yàn)閳D論及其應(yīng)用

馬靜靜：女，1997年生，碩士生，研究方向?yàn)閳D論及其應(yīng)用

通訊作者:
陳祥恩　chenxe@nwnu.edu.cn

中圖分類號: O157.5
計量
- 文章訪問數(shù): 1995
- HTML全文瀏覽量: 496
- PDF下載量: 36
- 被引次數(shù): 0
出版歷程
- 收稿日期: 2019-10-28
- 修回日期: 2020-04-27
- 網(wǎng)絡(luò)出版日期: 2020-07-24
- 刊出日期: 2020-12-08

Vertex-distinguishing IE-total Coloring of K_4,4,p(p≥1008)

Xiang’en CHEN^,,
Jingjing MA

College of Mathematics and statistics, Northwest Normal University, Lanzhou 730070, China

Funds: The National Natural Science Foundation of China (11761064, 61163037)

摘要

摘要: 該文利用色集事先分配法、構(gòu)造染色法、反證法探討了完全三部圖K_4,4,p (p≥1008)的點(diǎn)可區(qū)別IE-全染色問題，確定了K_4,4,p (p≥1008)的點(diǎn)可區(qū)別IE-全染色數(shù)。
- 完全三部圖 /
- IE-全染色 /
- 點(diǎn)可區(qū)別IE-全染色 /
- 點(diǎn)可區(qū)別IE-全色數(shù)
Abstract: The vertex-distinguishing IE-total coloring of complete tripartite graphs K_4,4,p (p≥1008) is discussed, by using of the methods of distributing the color sets in advance, constructing the colorings and contradiction. The vertex-distinguishing IE-total chromatic number of K_4,4,p (p≥1008) is determined.
- Complete tripartite graph /
- IE-total coloring /
- Vertex-distinguishing IE-total coloring /
- Vertex-distinguishing IE-total chromatic number

HTML全文

參考文獻(xiàn)(19)

HARARY F and PLANTHOLT M. The Point-Distinguishing Chromatic Index[M]. HARARY F and MAYBEE J S. Graphs and Application. New York: Wiley, 1985: 147–162.

HOR?áK M and SOTáK R. The fifth jump of the point-distinguishing chromatic index of K_{n, n}[J]. ARS Combinatoria-Waterloo then Winnipeg, 1996, 42: 233–242.

HOR?áK M and SOTáK R. Localization of jumps of the point-distinguishing chromatic index of K_{n, n}[J]. Discussiones Mathematicae Graph Theory, 1997, 17(2): 243–251. doi: 10.7151/dmgt.1051

HOR?áK M and ZAGALIA SALVI N. On the point-distinguishing chromatic index of K_{m, n}[J]. ARS Combinatoria, 2006, 80: 75–85.

ZAGAGLIA SALVI N. On the value of the point-distinguishing chromatic index of K_{n, n}[J]. ARS Combinatoria, 1990, 29B: 235–244.

CHEN Xiang’en. Point-distinguishing chromatic index of the union of paths[J]. Czechoslovak Mathematical Journal, 2014, 64(3): 629–640. doi: 10.1007/s10587-014-0123-8

CHEN Xiang’en, GAO Yuping, and YAO Bing. Vertex-distinguishing IE-total colorings of complete bipartite graphs K_{m, n}(m<n)[J]. Discussiones Mathematicae Graph Theory, 2013, 33(2): 289–306. doi: 10.7151/dmgt.1659

LIU Chanjuan and ZHU Enqiang. General vertex-distinguishing total coloring of graphs[J]. Journal of Applied Mathematics, 2014, 2014: 849748.

許進(jìn). 極大平面圖的結(jié)構(gòu)與著色理論(1)色多項(xiàng)式遞推公式與四色猜想[J]. 電子與信息學(xué)報, 2016, 38(4): 763–779. doi: 10.11999/JEIT160072

XU Jin. Theory on the structure and coloring of maximal planar graphs (1)recursion formula of chromatic polynomial and four-color conjecture[J]. Journal of Electronics &Information Technology, 2016, 38(4): 763–779. doi: 10.11999/JEIT160072

許進(jìn). 極大平面圖的結(jié)構(gòu)與著色理論(2)多米諾構(gòu)形與擴(kuò)縮運(yùn)算[J]. 電子與信息學(xué)報, 2016, 38(6): 1271–1327. doi: 10.11999/JEIT160224

XU Jin. Theory on structure and coloring of maximal planar graphs (2) Domino configurations and extending-contracting operations[J]. Journal of Electronics &Information Technology, 2016, 38(6): 1271–1327. doi: 10.11999/JEIT160224

許進(jìn). 極大平面圖的結(jié)構(gòu)與著色理論(3)純樹著色與唯一4-色極大平面圖猜想[J]. 電子與信息學(xué)報, 2016, 38(6): 1328–1363. doi: 10.11999/JEIT160409

XU Jin. Theory on structure and coloring of maximal planar graphs (3) purely tree-colorable and uniquely 4-colorable maximal planar graph conjecture[J]. Journal of Electronics &Information Technology, 2016, 38(6): 1328–1363. doi: 10.11999/JEIT160409

許進(jìn). 極大平面圖的結(jié)構(gòu)與著色理論(4)σ-運(yùn)算與Kempe等價類[J]. 電子與信息學(xué)報, 2016, 38(7): 1557–1585. doi: 10.11999/JEIT160483

XU Jin. Theory on structure and coloring of maximal planar graphs (4)σ-operations and Kempe equivalent classes[J]. Journal of Electronics &Information Technology, 2016, 38(7): 1557–1585. doi: 10.11999/JEIT160483

XU Jin, LI Zepeng, and ZHU Enqiang. On purely tree-colorable planar graphs[J]. Information Processing Letters, 2016, 116(8): 532–536. doi: 10.1016/j.ipl.2016.03.011

許進(jìn), 李澤鵬, 朱恩強(qiáng). 極大平面圖理論研究進(jìn)展[J]. 計算機(jī)學(xué)報, 2015, 38(8): 1680–1704. doi: 10.11897/SP.J.1016.2015.01680

XU Jin, LI Zepeng, and ZHU Enqiang. Research progress on the theory of maximal planar graphs[J]. Chinese Journal of Computers, 2015, 38(8): 1680–1704. doi: 10.11897/SP.J.1016.2015.01680

陳祥恩, 李婷. (k,l)-遞歸極大平面圖的結(jié)構(gòu)[J]. 電子與信息學(xué)報, 2018, 40(9): 2281–2286. doi: 10.11999/JEIT171021

CHEN Xiang’en and LI Ting. The structure of (k,l)-recursive maximal planar graph[J]. Journal of Electronics &Information Technology, 2018, 40(9): 2281–2286. doi: 10.11999/JEIT171021

劉小青, 許進(jìn). 4-正則圖著色的Kempe等價性[J]. 電子與信息學(xué)報, 2017, 39(5): 1233–1244. doi: 10.11999/JEIT160716

LIU Xiaoqing and XU Jin. Kempe equivalence of colorings of 4-regular graphs[J]. Journal of Electronics &Information Technology, 2017, 39(5): 1233–1244. doi: 10.11999/JEIT160716

LI Zepeng, ZHU Enqiang, SHAO Zehui, et al. Size of edge-critical uniquely 3-colorable planar graphs[J]. Discrete Mathematics, 2016, 339(4): 1242–1250. doi: 10.1016/j.disc.2015.11.009

LI Zepeng, ZHU Enqiang, SHAO Zehui, et al. A note on uniquely 3-colourable planar graphs[J]. International Journal of Computer Mathematics, 2017, 94(5): 1028–1035. doi: 10.1080/00207160.2016.1167196

ZHU Enqiang, LI Zepeng, SHAO Zehui, et al. Acyclically 4-colorable triangulations[J]. Information Processing Letters, 2016, 116(6): 401–408. doi: 10.1016/j.ipl.2015.12.005

相關(guān)文章

施引文獻(xiàn)

資源附件(0)

訪問統(tǒng)計