期刊文献+

广义θ-图的分数关联色数 被引量:1

On Fractional Incidence Chromatic Number of Generalized θ-graph
下载PDF
导出
摘要 本文从分数色数的定义和已有结论出发,针对两种不同的情况分别给出广义θ-图的分数关联色数,并由此进一步给出广义θ-图的r-冠图的分数关联色数,得到如下结论:incf(θk)={k+1,至少有一条路径的长不为2k2k-1,所有路径的长均为2;incf(Ir(θk))=inc(Ir(θk))=k+r+1。 The issue of coloring is a very important in the graph theory.Fractional coloring as generalized coloring has used in many fields of computer science.This paper compute the fractional incidence chromatic number of generalized θ-graph from to two different situations and using its definition and given lemma.Then,the fractional incidence chromatic number of r-corona graph for generalized θ-graph is obtained.The main results we give as follows:1) incf(θk)={k+1,at least one path from u to v has longth≠2k2k-1,otherwise;2) incf(Ir(θk))=inc(Ir(θk))=k+r+1.
作者 高炜 梁立
出处 《重庆师范大学学报(自然科学版)》 CAS 2010年第6期36-39,共4页 Journal of Chongqing Normal University:Natural Science
基金 国家自然科学基金项目(No.60903131)
关键词 分数色数 分数团 广义θ-图 r-冠图 fractional chromatic number fractional clique generalized θ-graph r-corona graph
  • 相关文献

参考文献8

二级参考文献23

  • 1韩金仓,张忠辅.关于θ图的若干参数[J].太原机械学院学报,1993,14(4):288-291. 被引量:3
  • 2Huang YuanqiuDept.of Math.,Hunan Normal Univ.,Changsha 41 0 0 81 . Email:hyqq @public.cs.hn.cn.A NOTE ON THE MAXIMUM GENUS OF 3-EDGE-CONNECTED NONSIMPLE GRAPHS[J].Applied Mathematics(A Journal of Chinese Universities),2000,15(3):247-251. 被引量:2
  • 3刘桂真.与星正交的(g,f)-因子分解[J].中国科学(A辑),1995,25(4):367-373. 被引量:28
  • 4黄元秋,刘彦佩.图的上可嵌入性的一些表征[J].北方交通大学学报,1996,20(1):42-49. 被引量:5
  • 5Vince A. Star Chromatic Number[ J]. Graph Theory, 1988,12:551 - 559.
  • 6Scheinerman E R, Ullman D H. Fractional Graph Theory[ M]. John Wiley and Sons, Inc. New York,1997.
  • 7Bondy J A, Murty U S R. Graph theory with applications[ M]. New York: Macmillan Press Lid. 1976.
  • 8Michael MoUoy, Bruce Reed. Graph coloring and the Probabilistic Method [ M ]. Berlin:Springer,2002.
  • 9E. R. Scheinerman and D. H. Ullman, Fractional Graph Theory[ M ] , John Wiley and Sons, Inc. New York, 1997.
  • 10C.贝尔热著.卜月华,张克明译.超图--有限集的组合学[M].无锡:东南大学出版社,2002.

共引文献14

同被引文献15

  • 1Erd(o)s P,Lovász L. Problems and results on 3-chromatic hypergraphs and some related questions[A].Amsterdam:north-holland,1975.609-628.
  • 2Alon N,McDiarmid C,Reed B. Acyclic coloring of graphs[J].Random Structures and Algorithms,1991,(03):277-288.
  • 3Fu H Y,Xie D Z. A note on star chromatic number of graphs[J].Journal of Mathematical Research and Exposition,2010,(05):841-844.
  • 4Fertin G,Raspaud B,Reed B. Star coloring of graphs[J].Journal of Graph Theory,2004,(03):163-182.doi:10.1002/jgt.20029.
  • 5Grünbaum B. Acyclic colorings of planar graphs[J].Israel Journal of Mathematics,1973,(04):390-408.
  • 6Albertson M O,Chappell G G,Kersted H A. Coloring with no 2-colored P4' s[J].Electronic Journal of Combinatorics,2004,(01):1-13.
  • 7Nesetril J,de Mendez P O. Colorings and homomorphisms of minor closed classes Technical Report 476[R].Centre de Recerca Matematica,2001.
  • 8Bollobá B. Random Graphs[M].London,UK:Academic Press,1985.
  • 9Bondy J A,Murty U S R. Graph Theory[M].Beilin:Springer-Verlag,2008.
  • 10Scott A D,Sokal A D. The repulsive lattice gas,the indenpendent-set polynomial,and the Lovász local lemma[J].Journal of Statistical Physics,2005,(05):1151-1265.

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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