维普中文期刊产品整合服务
103篇 您的检索式:期刊名="Journal of combinatorial theory series B"
    题名 作者 年代 出处 被引量
1On the spectral radius and the genus of graphs 显示文摘Hong Y 1995Journal of Combinatorial Theory Series B1995,,2:1
2Exponential Families of Non-isomorphic Non-triangular Orientable Genus Embeddings of Complete Graphs显示文摘Vladimir P. Korzhik Heinz-Jurgen Voss 2002Journal of Combinatorial Theory Series B2002,,1:1
3Face 2-Colourable Triangular Embeddings of Complete Graphs显示文摘M.J. Grannell T.S. Griggs Jozef ?iráň 1998Journal of Combinatorial Theory Series B1998,,1:1
4On weekly symmetric graphs of order twice a prime 显示文摘Cheng Y Oxley J 1987Journal of Combinatorial Theory Series B1987,42,:1
5The spectral radius of graphs on surface显示文摘Ellingham M N Zha Xiaoya 2000Journal of Combinatorial Theory Series B2000,78,:1
6A Sharp Upper Bound of the Spectral Radius of Graphs显示文摘Yuan Hong Jin-Long Shu Kunfu Fang 2001Journal of Combinatorial Theory, Series B2001,,:1
7Finding Hamilton cycles in sparse random graphs 显示文摘Frieze Alan M 1988Journal of Combinatorial Theory : Series B1988,44,2:1
8Vertex-primitive graphs of order a product of two distinct primes 显示文摘Praeger C E Xu M Y 1993Journal of Combinatorial Theory Series B1993,59,:1
9Symmetric graphs of order a product of two distinct primes 显示文摘Praeger C E Wang R J Xu M Y 1993Journal of Combinatorial Theory Series B1993,58,:1
10An analogue of the Gallai-Edmonds structure theorem for non-zero roots of the matching polynomial显示文摘Cheng Yeaw Ku William Chen 2010Journal of Combinatorial Theory Series B2010,100,:1
11Asymptotic normality of the size of the giant component via a random walk显示文摘Bollobds B Riordan O 2012Journal of Combinatorial Theory (Series B)2012,102,1:1
12Some lower bounds of the ramsey numbers n( k ,k) 显示文摘BURLING J P REYNER S W 1972Journal of Combinatorial Theory Series B1972,13,:1
13Towards a splitter theorem for internally 4-connected binary ma- troids显示文摘Chun C Mayhew D Oxley J 2012Journal of Combinatorial Theory Series B2012,102,3:1
14On a class of posets and the corresponding comparability graphs显示文摘Jung H A 1978Journal of Combinatorial Theory Series B1978,24,2:1
15A bound on the chromatic number of the square of a planar graph显示文摘MOLLOY M SALAVATIPOUR M 2006Journal of Combinatorial Theory : Series B2006,94,:1
16Asymptotic normality of the size of the giant component via a random walk显示文摘Béla Bollobás Oliver Riordan 2011Journal of Combinatorial Theory, Series B2011,,1:1
17Δ + 300 is a bound on the adjacent vertex distinguishing edge chromatic number显示文摘Hatami H 2005Journal of Combinatorial Theory (Series B)2005,95,:1
18Planar graphs without cycles of length from 4 to 7 are 3-colorable 显示文摘Borodin OV Glebov A N RasPaud A 2005Journal of Combinatorial Theory Series B2005,93,2:1
19Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable 显示文摘Borodin O V Gtebov A N Montassier M 2009Journal of Combinatorial Theory Series B2009,99,:1
20Circular Chromatic Number and a Generalization of the Construction of Mycielski显示文摘LAM P C B LIN W S GU G H SONG Z M 2003Journal of Combinatorial Theory Series B2003,,89:1
返回顶部 每页显示:
共6页 首页 上一页 第1页 下一页 末页 /6 跳转

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

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

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