全文获取类型
收费全文 | 5202篇 |
免费 | 420篇 |
国内免费 | 330篇 |
专业分类
化学 | 212篇 |
晶体学 | 2篇 |
力学 | 27篇 |
综合类 | 142篇 |
数学 | 5279篇 |
物理学 | 290篇 |
出版年
2024年 | 23篇 |
2023年 | 98篇 |
2022年 | 174篇 |
2021年 | 130篇 |
2020年 | 197篇 |
2019年 | 223篇 |
2018年 | 214篇 |
2017年 | 199篇 |
2016年 | 123篇 |
2015年 | 90篇 |
2014年 | 173篇 |
2013年 | 445篇 |
2012年 | 189篇 |
2011年 | 294篇 |
2010年 | 296篇 |
2009年 | 436篇 |
2008年 | 380篇 |
2007年 | 274篇 |
2006年 | 315篇 |
2005年 | 214篇 |
2004年 | 199篇 |
2003年 | 167篇 |
2002年 | 163篇 |
2001年 | 152篇 |
2000年 | 140篇 |
1999年 | 135篇 |
1998年 | 117篇 |
1997年 | 78篇 |
1996年 | 49篇 |
1995年 | 52篇 |
1994年 | 39篇 |
1993年 | 27篇 |
1992年 | 25篇 |
1991年 | 15篇 |
1990年 | 12篇 |
1989年 | 15篇 |
1988年 | 15篇 |
1987年 | 9篇 |
1986年 | 4篇 |
1985年 | 12篇 |
1984年 | 12篇 |
1983年 | 4篇 |
1982年 | 10篇 |
1981年 | 3篇 |
1980年 | 3篇 |
1977年 | 2篇 |
1976年 | 1篇 |
1975年 | 3篇 |
1974年 | 2篇 |
排序方式: 共有5952条查询结果,搜索用时 15 毫秒
81.
Richard Arratia Bla Bollobs Gregory B. Sorkin 《Journal of Combinatorial Theory, Series B》2004,92(2):199-233
Motivated by circle graphs, and the enumeration of Euler circuits, we define a one-variable “interlace polynomial” for any graph. The polynomial satisfies a beautiful and unexpected reduction relation, quite different from the cut and fuse reduction characterizing the Tutte polynomial.It emerges that the interlace graph polynomial may be viewed as a special case of the Martin polynomial of an isotropic system, which underlies its connections with the circuit partition polynomial and the Kauffman brackets of a link diagram. The graph polynomial, in addition to being perhaps more broadly accessible than the Martin polynomial for isotropic systems, also has a two-variable generalization that is unknown for the Martin polynomial. We consider extremal properties of the interlace polynomial, its values for various special graphs, and evaluations which relate to basic graph properties such as the component and independence numbers. 相似文献
82.
83.
84.
Michel Vasquez 《Journal of Heuristics》2004,10(4):407-413
For the Queens_n
2 graph coloring problems no chromatic numbers are available for n > 9 except where n is not a multiple of 2 or 3. In this paper we propose an exact algorithm that takes advantage of the particular structure of these graphs. The algorithm works on the independent sets of the graph rather than on the vertices to be colored. It combines branch and bound, for independent set assignment, with a clique based filtering procedure. A first experimentation of this approach provided the coloring number values ranging for n = 10 to n = 14. 相似文献
85.
Ioan Tomescu 《Journal of Graph Theory》2003,43(3):210-222
In the set of graphs of order n and chromatic number k the following partial order relation is defined. One says that a graph G is less than a graph H if ci(G) ≤ ci(H) holds for every i, k ≤ i ≤ n and at least one inequality is strict, where ci(G) denotes the number of i‐color partitions of G. In this paper the first ? n/2 ? levels of the diagram of the partially ordered set of connected 3‐chromatic graphs of order n are described. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 210–222, 2003 相似文献
86.
JINJIANG YUAN 《运筹学学报》1998,(3)
1.IntroductionGraphsconsideredinthispaperarefiniteandsimple.FOragraphG,V(G)andE(G)denoteitssetofvenicesandedges,respectively.AbijectionwillbecalledalabellingofG.Letpbeapositiverealnumber.ForagivenlabellingTofagraphG,definethegndiscrepencya.(G,ac)ofTasTheobjectiveoftheminimum-p--sumproblemistofindalabelling7ofagraphGsuchthatac(G,T)isassmallaspossible.ThelabellingTminimizinga.(G,7)iscalledanoptimalHsumlabellingofG.Theminimumvalueiscalledtheminimum-psumofG.ItisshowninI31thattheminimum-… 相似文献
87.
关于k—消去图的若干新结果 总被引:2,自引:0,他引:2
汪长平 《数学物理学报(A辑)》1998,18(3):302-309
设G是一个图.k是自然数.图G的一个k-正则支撑子图称为G的一个k-因子.若对于G的每条边e.G—e都存在一个k-因子,则称G是一个k-消去图.该文得到了一个图是k-消去图的若干充分条件,推广了文[2—4]中有关结论. 相似文献
89.
Vladimir P. Korzhik 《Discrete Mathematics》1998,190(1-3):149-162
The author has proposed methods of constructing index 2 and 3 current graphs generating triangular embeddings of graphs Kn−Km with unboundedly large m (as n increases). As a result, triangular embeddings of graphs of many families of graphs Kn−Km with unboundedly large m were constructed. The paper gives a survey of these results and a short explanation of the methods. 相似文献
90.
李相文 《数学物理学报(B辑英文版)》1998,(2)
1IntroductionWeuseBondyandMurtyl3]forterminologyand..ta'ti..notdefinedhereandconsidersimpleconnectedgraphsonly.AcircuitCofagraphGisanontrivialconnectedeuleriansubgraphofG.Aspanningcircuit,orbrieflyS-circuit,ofagraphGisacircuitthatcontainsallvenicesofG.AdominatingcircuitorD-circuitofGisacircuitsuchthateveryedgeofGisincidentwithatleastonevertexofthecircuit.AgraphofordernispancyclicifitcontainsallcyclesoflengthIfor3515n.IfCisacircuitofG,thenP(C)denotesthenumberOfedgesofGincidentwithatleas… 相似文献