2025年4月6日 7:16 星期日
首页 > 过刊浏览>2016年第8卷第3期 >286-288. DOI:10.13878/j.cnki.jnuist.2016.03.011
PDF HTML阅读 XML下载 导出引用 引用提醒
Halin图的色数问题
作者:
基金项目:

国家自然科学基金 (11271197);江苏省普通高校研究生科研创新计划(CXLX13_502);南京信息工程大学科研基金(20110387,2012R101)


On the chromatic number of halin graphs
Author:
  • 摘要
    • | |
  • 访问统计
    • |
  • 参考文献
    • |
  • 相似文献
    • | | |
  • 文章评论
    摘要:

    Halin图G=T∪C,其中T为每一非悬挂点(内点)度数至少为3的平面树,C为连接T的所有悬挂点的圈.文章分别讨论了Halin图的星色数、面色数及分数色数.

    Abstract:

    A Halin graph is a plane graph G=T∪C,where T is a plane tree with no vertex of degree two and at least one vertex of degree three or more,C is a cycle connecting the endvertices of T in the cyclic order determined by the embedding of T.In this paper,we discuss the star chromatic number,the face chromatic number and the fractional chromatic number of Halin graphs.

    参考文献
    [1] Liu X S,An M Q,Gao Y.An upper bound for the adjacent vertex-distinguishing acyclic edge chromatic number of a graph[J].Acta Mathematica Applicatae Sinica English Series,2009,25(1):137-140
    [2] 张忠辅,李敬文,赵传成,等.若干联图的点可区别均匀边色数[J].数学学报,2007,50(1):197-204 ZHANG Zhongfu,LI Jingwen,ZHAO Chuancheng,et.al.On the vertex-distinguishing-equitable edge chromatic number of some join-graphs[J].Acta Mathematica Sinica,2007,50(1):197-204
    [3] 陈祥恩,高毓平.合成图的点可区别正常边色数[J].吉林大学学报:理学版,2011,49(2):207-212 CHEN Xiangen,GAO Yuping.Vertex-distinguishing proper edge-coloring chromatic numbers of the composition of two graphs[J].Journal of Jilin University:Science Edition,2011,49(2):207-212
    [4] Li D M.The star chromatic numbers of some graphs[J].Advances in Mathematics,1999,28(3):259-265
    [5] 马刚,马少仙,张忠辅.一些倍图的点可区别均匀边色数[J].经济数学,2008,25(4):437-440 MA Gang,MA Shaoxian,ZHANG Zhongfu.On the vertex-distinguishing-equitable edge chromatic number of some double-graphs[J].Mathematics in Economics,2008,25(4):437-440
    [6] Zhu X D.Planar graphs with circular chromatic numbers between 3 and 4[J].Journal of Combinatorial Theory Series B,1999,76(2):170-200
    [7] 徐保根.关于Halin图的边面全着色数[J].华东交通大学学报,1995,12(3):73-77 XU Baogen.The edge-face total chromatic number of Halin graphs[J].Journal of East China Jiaotong University,1995,12(3):73-77
    [8] 李鸿祥,张忠辅,张建勋.Halin图的色性[J].上海铁道学院学报,1994,15(1):19-24 LI Hongxiang,ZHANG Zhongfu,ZHANG Jianxun.The chromatic number of Halin graphs[J].Journal of Shanghai Institute of Railway Technology,1994,15(1):19-24
    [9] Bondy J A,Lovász L.Lengths of cycles in Halingraphs[J].J Graph Theory,2006,9(3):397-410
    [10] Zhu X D.Circular chromatic number:A survey[J].Discrete Mathematics,2001,229(1/2/3):371-410
    [11] Bondy J A,Murty USR.Graph theory with applications[M].Amsterdam:Elsevier Science Ltd/North-Holland,1976
    引证文献
    网友评论
    网友评论
    分享到微博
    发 布
引用本文

朱建,陈丽娟. Halin图的色数问题[J].南京信息工程大学学报(自然科学版),2016,8(3):286-288
ZHU Jian, CHEN Lijuan. On the chromatic number of halin graphs[J]. Journal of Nanjing University of Information Science & Technology, 2016,8(3):286-288

复制
分享
文章指标
  • 点击次数:922
  • 下载次数: 2734
  • HTML阅读次数: 0
  • 引用次数: 0
历史
  • 收稿日期:2015-09-09
  • 在线发布日期: 2016-06-23

地址：江苏省南京市宁六路219号    邮编：210044

联系电话：025-58731025    E-mail：nxdxb@nuist.edu.cn

南京信息工程大学学报 ® 2025 版权所有  技术支持：北京勤云科技发展有限公司