期刊文献+

蕴含K5-E(P2)的正可图序列 被引量:2

Potentially K_5-E(P_2)-graphic Sequences
下载PDF
导出
摘要 刻画蕴含K5-E(P2)的正可图序列,其中K5-E(P2)表示从K5中删去两条相邻的边后得到的图。 The characterization for a positive graphic sequence being potentially K5-E(P2)-graphic is ob- tained,where K5-E(P2) is the Rraph obtained from K5 by deleting two adjacent edges.
出处 《广西师范大学学报(自然科学版)》 CAS 北大核心 2009年第1期29-31,共3页 Journal of Guangxi Normal University:Natural Science Edition
基金 国家自然科学基金资助项目(10861006) 广西大学科研基金资助项目(X081034)
关键词 度序列 蕴含K5-E(P2)-可图序列 graph degree sequence potentially K5- E (P2)-graphic sequence
  • 相关文献

参考文献7

  • 1陈纲,尹建华,范英梅.蕴含kC_6的可图序列[J].广西师范大学学报(自然科学版),2006,24(3):26-29. 被引量:1
  • 2ESCHEN E M ,NIU J B. On potentially K4--e-graphic sequences[J]. Australasian J Combinatorics ,2004,29..59-65.
  • 3YIN Meng-xiao,YIN Jian-hua. On potentially H-graphic sequences[J]. Czechoslovak Mathematical Journal, 2007,57 (2):705-724.
  • 4KLEITMAN D J,WANG Da-lun. Algorithm for constructing graphs and digraphs with given valences and factors [J]. Discrete Math, 1973,6 (1) : 79-88.
  • 5ERDOS P,GALLAI T. Graphs with given degrees of vertices[J]. Math Lapok,1960,11:264-274.
  • 6YIN Jian-hua,LI Jiong-sheng. An extremal problem on potentially Kr,s-graphic sequences is true[J]. Discrete Math, 2003,260: 295-305.
  • 7GOULD R J,JACOBSON M S,LEHEL J. Potentially G-graphical degree sequences[C]//ALAVI Y. Combinatorics, Graph Theory,and Algorithms. Kalamazoo Michigan :New Issues Press, 1999 : 451-460.

二级参考文献10

  • 1GOULD R J,JACOBSON M S,LEHEL J.Potentially G-graphic degree sequences[C]//ALAVI Y.Combinatorics,Graph Theory,and Algorithms.Kalamazoo Michigan:New Issues Press,1999:451-460.
  • 2ERDOS P,JACOBSON M S,LEHEL J.Graphs realizing the degree sequences and their respective clique numbers[C]//ALAVI Y.Graph Theory,Combinatorics and Applications.New York:John Wiley & Sons,1991:439-449.
  • 3LI Jiong-sheng,SONG Zi-xia.An extremal problem on the potentially Pk-graphic sequence[J].Discrete Math,2000,212(3):223-231.
  • 4LI Jiong-sheng,SONG Zi-xia.The smallest degree sum that yields potentially Pk-graphic sequences[J].J Graph Theory,1998,29:63-72.
  • 5LAI Chun-hui.The smallest degree sum that yields potentially Ck-graphic sequences[J].Journal of Combinatorial Mathematics and Combinatorial Computing,2004,49:57-64.
  • 6LUO Rong.On potentially Ck-graphic sequences[J].Ars Combinatoria,2002,64:301-318.
  • 7KLEITMAN D J,WANG Da-lun.Algorithm for constructing graphs and digraphs with given valences and factors[J].Discrete Math,1973,6 (1):79-88.
  • 8LI Jiong-sheng,YIN Jian-hua.A variation of an extremal theorem due to Woodall[J].Southeast Asian Bulletin ofMathematics,2001,25:427-434.
  • 9赖春晖.蕴含C_K图的度序列[J].漳州师院学报,1997,11(4):27-31. 被引量:7
  • 10李炯生,宋梓霞,罗荣.The Erds-Jacobson-Lehel conjecture on potentially P_k-graphic sequence is true[J].Science China Mathematics,1998,41(5):510-520. 被引量:13

同被引文献26

  • 1徐幼专,徐立新.扇形图P_1∨P_m中保Wiener指数的树[J].郑州大学学报(理学版),2006,38(3):32-34. 被引量:6
  • 2Grinbaum B.Acyclic colorings of planar graphs[J].Israel J Math,1973,14:390-408.
  • 3Borodin O V.On acyclic coloring of planar graphs[J].Discrete Mathmatics,1979,25:211-236.
  • 4Burnstein M I.Every 4-valent graph has an acyclic 5 coloring[J].Soob(s)(c) Akad Nauk Gruzin SSR,1979,93:21 -24.
  • 5Alon N,Sudakov B,Zaks A.Acyclie edge colorings of graphs[J].J Graph Theory,2001,37:157 -167.
  • 6Alon N,Zaks A.Algorithmic aspects of acyclic edge colorings[J].Algorithmica,2002,32:611-614.
  • 7Basavaaraju M,Chandran L S.Acvclic edge colorings of subcubic graphs[J].Discrete Mathematics,2008,308:6650 -6653.
  • 8Erd(o)s P,Lovász L. Problems and results on 3-chromatic hypergraphs and some related questions[A].Amsterdam:north-holland,1975.609-628.
  • 9Alon N,McDiarmid C,Reed B. Acyclic coloring of graphs[J].Random Structures and Algorithms,1991,(03):277-288.
  • 10Fu H Y,Xie D Z. A note on star chromatic number of graphs[J].Journal of Mathematical Research and Exposition,2010,(05):841-844.

引证文献2

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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