全文获取类型
收费全文 | 7640篇 |
免费 | 459篇 |
国内免费 | 614篇 |
专业分类
化学 | 2438篇 |
晶体学 | 4篇 |
力学 | 132篇 |
综合类 | 139篇 |
数学 | 5628篇 |
物理学 | 372篇 |
出版年
2024年 | 17篇 |
2023年 | 149篇 |
2022年 | 190篇 |
2021年 | 156篇 |
2020年 | 241篇 |
2019年 | 280篇 |
2018年 | 282篇 |
2017年 | 265篇 |
2016年 | 185篇 |
2015年 | 134篇 |
2014年 | 278篇 |
2013年 | 589篇 |
2012年 | 369篇 |
2011年 | 450篇 |
2010年 | 430篇 |
2009年 | 608篇 |
2008年 | 574篇 |
2007年 | 476篇 |
2006年 | 485篇 |
2005年 | 363篇 |
2004年 | 342篇 |
2003年 | 227篇 |
2002年 | 249篇 |
2001年 | 198篇 |
2000年 | 171篇 |
1999年 | 177篇 |
1998年 | 160篇 |
1997年 | 118篇 |
1996年 | 86篇 |
1995年 | 85篇 |
1994年 | 72篇 |
1993年 | 41篇 |
1992年 | 50篇 |
1991年 | 38篇 |
1990年 | 18篇 |
1989年 | 31篇 |
1988年 | 23篇 |
1987年 | 16篇 |
1986年 | 8篇 |
1985年 | 18篇 |
1984年 | 17篇 |
1983年 | 4篇 |
1982年 | 12篇 |
1981年 | 6篇 |
1980年 | 6篇 |
1979年 | 5篇 |
1977年 | 3篇 |
1976年 | 3篇 |
1975年 | 3篇 |
1974年 | 4篇 |
排序方式: 共有8713条查询结果,搜索用时 15 毫秒
81.
82.
Valuations of dense near polygons were introduced in 16 . In the present paper, we classify all valuations of the near hexagons ??1 and ??2, which are related to the respective Witt designs S(5,6,12) and S(5,8,24). Using these classifications, we prove that if a dense near polygon S contains a hex H isomorphic to ??1 or ??2, then H is classical in S. We will use this result to determine all dense near octagons that contain a hex isomorphic to ??1 or ??2. As a by‐product, we obtain a purely geometrical proof for the nonexistence of regular near 2d‐gons, d ≥ 4, whose parameters s, t, ti (0 ≤ i ≤ d) satisfy (s, t2, t3) = (2, 1, 11) or (2, 2, 14). The nonexistence of these regular near polygons can also be shown with the aid of eigenvalue techniques. © 2005 Wiley Periodicals, Inc. J Combin Designs 14: 214–228, 2006 相似文献
83.
给出了半无爪图(quasi-claw-freegraph)点泛圈性方面的两个结果,作为推论,可得到D.Oberly,D.Sumner,L.Clark等人的相关结果. 相似文献
84.
The effect of ITO films thickness on the properties of flexible organic light emitting diode 总被引:1,自引:0,他引:1
Indium tin oxide (ITO) thin films were deposited on cyclic olefin copolymer substrate at room temperature by an inverse target sputtering system. The crystal structure and the surface morphology of the deposited ITO films were examined by X-ray diffraction and atomic force microscopy, separately. The electrical properties of the conductive films were explored by four-point probing. Visible spectrometer was used to measure the optical properties of ITO-coated films. The performance of the flexible organic light emitting diode device with different thickness anode was investigated in this study. 相似文献
85.
Mukund K. Gurjar 《Tetrahedron letters》2006,47(39):6979-6981
The synthesis of a chiral cyclic nitrone with l-arabino configuration and its application in the total synthesis of radicamine B is reported. An agreement in the spectral data with natural radicamine B but specific rotation with an opposite sign warranted a revision of the absolute configuration of radicamine B. 相似文献
86.
Daniel Quillen 《K-Theory》1989,3(3):205-246
We construct a spectral sequence to study cyclic cohomology for an extension A = R/I of algebras. When R is a free algebra we describe the cyclic cohomology of A in terms of traces defined on R or powers of I. Explicit cyclic cocycles representing the cyclic cohomology class belonging to the trace are constructed as analogues of Chern character and Chern-Simons forms.Dedicated to Alexander Grothendieck 相似文献
87.
Thomas Andreae 《Journal of Graph Theory》2002,39(4):222-229
For a graph A and a positive integer n, let nA denote the union of n disjoint copies of A; similarly, the union of ?0 disjoint copies of A is referred to as ?0A. It is shown that there exist (connected) graphs A and G such that nA is a minor of G for all n??, but ?0A is not a minor of G. This supplements previous examples showing that analogous statements are true if, instead of minors, isomorphic embeddings or topological minors are considered. The construction of A and G is based on the fact that there exist (infinite) graphs G1, G2,… such that Gi is not a minor of Gj for all i ≠ j. In contrast to previous examples concerning isomorphic embeddings and topological minors, the graphs A and G presented here are not locally finite. The following conjecture is suggested: for each locally finite connected graph A and each graph G, if nA is a minor of G for all n ? ?, then ?0A is a minor of G, too. If true, this would be a far‐reaching generalization of a classical result of R. Halin on families of disjoint one‐way infinite paths in graphs. © 2002 Wiley Periodicals, Inc. J Graph Theory 39: 222–229, 2002; DOI 10.1002/jgt.10016 相似文献
88.
Let D be a digraph. The competition-common enemy graph (CCE graph) of D has the same set of vertices as D and an edge between vertices u and v if and only if there are vertices w and x in D such that (w,u), (w,v), (u,x), and (v,x) are arcs of D. We call a graph a CCE graph if it is the CCE graph of some digraph. In this paper, we show that if the CCE graph of a doubly partial order does not contain C4 as an induced subgraph, it is an interval graph. We also show that any interval graph together with enough isolated vertices is the CCE graph of some doubly partial order. 相似文献
89.
We prove that if T is a tournament of order n > 6 in which any 4-sub-tournament is hamiltonian or transitive, then T is reconstructible in the sense of Ulam. 相似文献
90.
Lingsheng Shi 《Journal of Graph Theory》2005,50(3):175-185
The Ramsey number R(G1,G2) of two graphs G1 and G2 is the least integer p so that either a graph G of order p contains a copy of G1 or its complement Gc contains a copy of G2. In 1973, Burr and Erd?s offered a total of $25 for settling the conjecture that there is a constant c = c(d) so that R(G,G)≤ c|V(G)| for all d‐degenerate graphs G, i.e., the Ramsey numbers grow linearly for d‐degenerate graphs. We show in this paper that the Ramsey numbers grow linearly for degenerate graphs versus some sparser graphs, arrangeable graphs, and crowns for example. This implies that the Ramsey numbers grow linearly for degenerate graphs versus graphs with bounded maximum degree, planar graphs, or graphs without containing any topological minor of a fixed clique, etc. © 2005 Wiley Periodicals, Inc. J Graph Theory 相似文献