维普中文期刊产品整合服务
21篇 您的检索式:期刊名="Discuss Math Graph Theory"
    题名 作者 年代 出处 被引量
1Heavy cycles in weighted graphs显示文摘Bondy J A Broersma H J Heuvel J van den 2002Discuss Math Graph Theory2002,22,:1
2Aσ3 type condition for heavy cycles in weighted graphs显示文摘Zhang Shenggui Broersma H J Li Xueliang 2001Discuss Math Graph Theory2001,21,:1
3Localization jumps of the point-distinguishing chromatic index of K n,n 显示文摘HORNK M SOT K R 1997Discuss Math Graph Theory1997,17,:1
4The Ramsey number R(C7,C7,C7)显示文摘FAUDREE R J SCHELTEN A SCHIERMEYER I 2003Discuss Math Graph Theory2003,23,1:1
5The forcing geodetic number of a graph显示文摘 ZHANG P 1999Discuss Math Graph Theory1999,19,:1
6The crossing numbers of certain Cartesian products显示文摘Klesc M 1995Discuss Math Graph Theory1995,15,:1
7The crossing number of certain Cartesian products显示文摘KLE (SˇEˇ) M 1995Discuss Math Graph Theory1995,15,:1
8The forcing geodetic number of a graph显示文摘Chartrand G Zhang P 1999Discuss Math Graph Theory1999,19,1:1
9The crossing numbers of join products of paths with graphs of order four显示文摘Klesc M Schrotter S 2011Discuss Math Graph Theory2011,31,:1
10The forcing geodetic number of a graph显示文摘CHARTRAND G ZHANG P 1999Discuss Math Graph Theory1999,19,:1
11Precise upper bound for the strong edge chromatic number of sparse planar graphs 显示文摘Borodin O V Ivanova A O 2013Discuss Math Graph Theory2013,33,:1
12The set chromatic number of a graph显示文摘CHARTRAND G OKAMOTO F RASMUSSEN C W 2009Discuss Math Graph Theory2009,29,3:1
13Connectivity of path graphs显示文摘KNOR M NIEPEL L 2000Discuss Math Graph Theory2000,20,:1
14The sum number of d-partite complete hypergraphs显示文摘Teichert H M 1999Discuss Math Graph Theory1999,19,:1
15The crossing numbers of certain Cartesian products显示文摘Klesc M 1995Discuss Math Graph Theory1995,15,:1
16The use of Euler's formula in (3,1) * -list coloring显示文摘ZHAO Y HE W 2006Discuss Math Graph Theory2006,26,:1
17A note on total colorings of planar graphs without 4-cycles 显示文摘WANG P WU J L 2004Discuss Math Graph Theory2004,24,:1
18The forcing geodetic number of a graph显示文摘CHARTRAND G ZHANG P 1999Discuss Math Graph Theory1999,19,:1
19Precise upper bound for the strong edge chromatic number of sparse planar graphs显示文摘BORODIN O V IVANOVA A O 2013Discuss Math Graph Theory2013,33,:1
20Radio if-colorings of paths显示文摘Chartrand D Nebesky L Zhang P 2004Discuss Math Graph Theory2004,24,:1
返回顶部 每页显示:
共2页 首页 上一页 第1页 下一页 末页 /2 跳转

网站首页 | 关于我们 | 联系我们 | 产品服务 | 客服中心 | 广告服务 | 版权声明 | 网站联盟 | 友情链接 | 售卡网点

版权所有© 渝B2-20050021-1 渝公网安备 50019002500403号 违法和不良信息举报中心

互联网出版许可证 新出网证(渝)字10号 全国400电话 - 免长途话费