维普期刊资源整合服务平台（V6.5）

89篇 您的检索式：作者名="BOLLOBAS B"

选中清除导出查看参考文献查看引证文献引用追踪共5页首页上一页第1页下一页末页 /5 跳转

	题名	作者	年代	出处	被引量
1	Vertex distinguishing colorings of graphs with △ (G) = 2 显示文摘	Balister P N Bollobas B Schelp R H	2002	Discrete Mathematics2002，252，：	1
2	Mannila:time-series similarity problems and well-separated geometric sets显示文摘	Bollobas B Das G Gunopulos D	2001	Nordic Journal on Computing2001，8，4：	1
3	A probabilistic proof of an asymptotic formula for the number of labeled regular graphs显示文摘	Bollobas B	1980	European Journal of Combinatorics1980，，1：	1
4	Highly linked graphs显示文摘	Bollobas B Thomason A	1996	Combinatorica1996，16，：	1
5	The degree sequence of a scale-free random graph process显示文摘	Bollobas B Riordan O M Spencer J	2001	Random Structures and Algorithms2001，18，3：	1
6	Vertex-distingulshing colorings of graphs with A(G) = 2显示文摘	BALISTER P N BOLLOBAS B SCHELP R H	2002	Discrete Math2002，252，13：	1
7	Judicious partitions of graph显示文摘	Bollobas B Scott A D	1993	Period Math Hungar1993，26，2：	1
8	Exact bounds for judicious partitions of graphs显示文摘	Bollobas B Scott A D	1999	Combinatorica1999，19，4：	1
9	Vertex distinguishing colorings of graphs with A (G) = 2 显示文摘	BALISTER P N BOLLOBAS B SCHELP R H	2002	Discrete Mathematics2002，252，：	1
10	Judicious partitions of bounded-degree graphs显示文摘	Bollobas B Scott A D	2004	J Graph Theory2004，46，2：	1
11	Graph-theoretic parameters concerning domination, independence,and irredundance 显示文摘	BOLLOBAS B COCKAYNE E J	1979	J Graph Theory1979，3，：	1
12	Problems and results on judicious partitions显示文摘	Bollobas B Scott A D	2002	Random Struct Alg2002，21，34：	1
13	The degreesequence of a scale-free random graph process 显示文摘	Bollobas B Riordan O Spencer J	2001	Random Structuress Algorithms2001，18，：	1
14	The diametre of a scale-freerandom graphs 显示文摘	Bollobas B Riodan O	2004	Combinatorica2004，24，1：	1
15	Robustness and Vulnerabil- ity of Scale-free Random Graphs 显示文摘	BOLLOBAS B RIORDAN O	2003	Internet Math2003，1，01：	1
16	Graphs of Extremal Wieghts显示文摘	Bollobas B Erdos P	1998	Ars Combin1998，50，：	1
17	Robustness and Vulnerability of Scale-free Random Graphs 显示文摘	B Bollobas O Riordan	2003	lnternet Mathe- matics2003，1，1：	1
18	Vertex-distinguishing colorings of graphs with △(G) = 2显示文摘	P N Balister B Bollobas R H Schelp	2002	Discrete Mathematics2002，252，：	1
19	The degree sequence of a scale-free random graph process显示文摘	BOLLOBAS B RIORDAN O M SPENCER J	2001	Random Struct and Algorithms2001，18，：	1
20	Vertex distinguishing colorings of graphs with △(G)= 2显示文摘	Balister P N Bollobas B Schelp R H	2002	Discrete Mathematics2002，252，2：	1

返回顶部每页显示：

共5页首页上一页第1页下一页末页 /5 跳转

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

用户提示