期刊文献+

图D_(m,4)的[r,s,t]-着色

[r,s,t]-Colouring of Graph D_(m,4)
下载PDF
导出
摘要 由m个四回路恰有一个公共点构成的图记为Dm,4。研究图Dm,4的点着色、边着色和全着色,给出图Dm,4在参数r,s,t满足一定条件时的[r,s,t]-色数。 Let a graph contains m cycles C4 of lengths 4 have a common vertex,then we denote this graph as Dm,4.Then we study the vertex coloring,edge coloring and total coloring of Graph Dm,4,and give the [r,s,t]-chromatic numbers of the Graph Dm,4 when the parameters r,s,and t meet certain conditions.
出处 《广西科学》 CAS 2012年第1期31-34,共4页 Guangxi Sciences
基金 广西教育厅面上项目(200807MS098) 柳州师范高等专科学校基金项目(LSZ2010B003)资助
关键词 图Dm 4 [r s t]-着色 [r s t]-色数 graph graph Dm 4 [r s t]-colouring [r s t]-chromatic number
  • 相关文献

参考文献8

  • 1Kemnitz A,Marangio M.[r,s,t]?colorings of graphs[J].Discrete Math,2007,307:199-207.
  • 2Yap H P.Total coloring of graphs,lecture notes inmathematics 1623[M].Berlin:Heidlberg Springer Ver-lag,1996:1-11.
  • 3Kemnitz A,Marangio M,Mihók P.[r,s,t]?chromaticnumbers and hereditary properties of graphs[J].Dis-crete Mathematics,2007,307:916-922.
  • 4龚劬,张新军.二部图的[r,s,t]-着色[J].重庆大学学报(自然科学版),2007,30(12):95-97. 被引量:9
  • 5Dekar L,Effantin B,Kheddouci H.[r,s,t]?coloring oftrees and bipartite graphs[J].Discrete Mathematics,2008,311:1521-1533.
  • 6俞竺君,左连翠.含点不交偶圈的图的[r,s,t]-着色[J].天津师范大学学报(自然科学版),2010,30(2):18-22. 被引量:5
  • 7Bondy J A,Murty U S R.Graph theory[M].Berlin:Springer,2008.
  • 8李光海,李武装.关于几类图的邻点可区别全染色[J].河南师范大学学报(自然科学版),2006,34(1):139-140. 被引量:5

二级参考文献18

  • 1ZHANG Zhongfu, CHEN Xiang’en, LI Jingwen, YAO Bing, LU Xinzhong & WANG Jianfang College of Mathematics and Information Science, Northwest Normal University, Lanzhou 730070, China,Department of Computer, Lanzhou Normal College, Lanzhou 730070, China,Institute of Applied Mathematics, Lanzhou Jiaotong University, Lanzhou 730070, China,College of Information and Electrical Engineering, Lanzhou Jiaotong University, Lanzhou 730070, China,Institute of Applied Mathematics, Chinese Academy of Sciences, Beijing 100080, China.On adjacent-vertex-distinguishing total coloring of graphs[J].Science China Mathematics,2005,48(3):289-299. 被引量:176
  • 2Coja Oghlan A,Kuhtz L.An improved algorithm for approximating the chromatic number of Gn,p[J].Information Processing Letters,2006,99:234-238.
  • 3Molloy M,Salavatipour M.A bound on the chromatic number of the square of a planar graph[J].Journal of Combinatorial Theory,Series B,2006,94:189-213.
  • 4Heuberger C.On planarity and colorability of circulant graphs[J].Discrete Mathematics,2003,268:153-169.
  • 5Vizing V G.On an estimate of the chromatic class of a p-graph[J].Metody Diskretnogo Analiza,1964,3:25-30.
  • 6Behzad M.Graphs and their chromatic numbers[D].East Lansing:Michigan State University,1965.
  • 7Vizing V G.Critical graphs with given chromatic class[J].Metody Diskretnogo Analiza,1965,5:9-17.
  • 8Kemnitz A,Marangio M.[r,s,t]-colorings of graphs[J].Discrete Mathematics,2007,307:199-207.
  • 9Bazzaro F,Montassier M,Raspaud A.(d,1)-total labelling of planar graphs with large girth and high maximum degree[J].Discrete Mathematics,2007,307:2141-2151.
  • 10Dekar L,Effantin B,Kheddouci H.[r,s,t]-coloring of trees and bipartite graphs[J].Discrete Mathematics,2008,311:1521-1533.

共引文献11

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部