全文获取类型
收费全文 | 206篇 |
免费 | 5篇 |
国内免费 | 1篇 |
专业分类
化学 | 131篇 |
晶体学 | 2篇 |
力学 | 2篇 |
数学 | 35篇 |
物理学 | 42篇 |
出版年
2023年 | 2篇 |
2022年 | 2篇 |
2021年 | 4篇 |
2020年 | 5篇 |
2019年 | 4篇 |
2018年 | 2篇 |
2016年 | 7篇 |
2015年 | 4篇 |
2014年 | 5篇 |
2013年 | 8篇 |
2012年 | 12篇 |
2011年 | 9篇 |
2009年 | 2篇 |
2008年 | 4篇 |
2007年 | 8篇 |
2006年 | 9篇 |
2004年 | 6篇 |
2003年 | 2篇 |
2002年 | 3篇 |
2001年 | 2篇 |
2000年 | 2篇 |
1998年 | 2篇 |
1997年 | 6篇 |
1995年 | 2篇 |
1993年 | 3篇 |
1992年 | 2篇 |
1991年 | 7篇 |
1990年 | 6篇 |
1989年 | 3篇 |
1987年 | 3篇 |
1986年 | 3篇 |
1985年 | 4篇 |
1984年 | 2篇 |
1983年 | 2篇 |
1982年 | 5篇 |
1981年 | 3篇 |
1980年 | 4篇 |
1979年 | 7篇 |
1978年 | 4篇 |
1977年 | 6篇 |
1976年 | 5篇 |
1975年 | 3篇 |
1974年 | 3篇 |
1973年 | 4篇 |
1970年 | 4篇 |
1965年 | 2篇 |
1925年 | 1篇 |
1919年 | 2篇 |
1902年 | 1篇 |
1889年 | 1篇 |
排序方式: 共有212条查询结果,搜索用时 18 毫秒
111.
112.
The values of the chromatic and achromatic number, point- and line-connectivity, and point independence number of the lexicographic product of two graphs are examined in relation to the values of the respective parameters on the factor graphs. 相似文献
113.
Saul Stahl 《Journal of Combinatorial Theory, Series B》1983,35(1):28-38
The concept of the genus of a pair of permutations is defined in the same manner as was done by Jacques. The integrality of the genus is proven in a new way by applying a technique developed by Walkup for the reduction of products of permutations. These tools are then used to prove an analog of the Jordan Curve Theorem for a pair of permutations whose genus is zero. A Jordan Curve Theorem for plane embeddings of graphs then follows as a corollary. 相似文献
114.
Saul Barshay 《Physics letters. [Part B]》1981,100(5):376-380
We estimate the strength of a new three-body force between three nucleons in close proximity which arises from the self-coupling of three coloured gluons. It is possible that this force can account for the recently measured depression of the central charge density in . 相似文献
115.
Saul Stahl 《Journal of Graph Theory》1978,2(1):41-52
Covering projections are used to provide a logical foundation for the generalized embedding schemes which describe embeddings of graphs on closed surfaces that are not necessarily orientable. Criteria are provided to resolve the question of when such schemes describe the same embedding, and when that embedding is orientable. The schemes are then applied to derive some interpolation-type theorems for embeddings on closed surfaces. 相似文献
116.
Patel AB Allen S Davies MC Roberts CJ Tendler SJ Williams PM 《Journal of the American Chemical Society》2004,126(5):1318-1319
The strength of a multimolecular system depends on the number of interactions that hold it together. Using dynamic force spectroscopy, we show how the kinetic stability of a system decreases as the number of molecular bonds is increased, as predicted by theory. The data raise important considerations for experimental tests of bond strength and, as a paradigm, suggest both routes to and pitfalls in methods for computational simulation of molecular transitions, such as ligand binding and protein folding. 相似文献
117.
118.
Saul T. Epstein 《Theoretical chemistry accounts》1981,59(6):625-628
The concept of a best adiabatic potential is discussed. It is emphasized that it should be best for a number of states, not just for a single state. One particular figure of merit is introduced and applied to a simple model. 相似文献
119.
It has been shown, by double zeta quality ab initio MO calculations, that, in the gas phase, a CH bond adjacent to sulphur is more acidic than a CH bond adjacent to oxygen. This trend is in agreement with experimental observations in solution. 相似文献
120.
Saul Stahl 《Journal of Combinatorial Theory, Series B》1976,20(2):185-203
The n-tuple graph coloring, which assigns to each vertex n colors, is defined together with its respective chromatic number xn. It is proved that these numbers satisfy the inequality xn ≥ 2 + xn?1, and that equality holds only for bipartite graphs. Graphs are defined which play the same role for the n-tuple coloring that Km plays for the conventional coloring. The chromatic numbers of various classes of graphs are also calculated. 相似文献