全文获取类型
收费全文 | 3524篇 |
免费 | 206篇 |
国内免费 | 155篇 |
专业分类
化学 | 126篇 |
晶体学 | 3篇 |
力学 | 73篇 |
综合类 | 34篇 |
数学 | 3229篇 |
物理学 | 420篇 |
出版年
2024年 | 13篇 |
2023年 | 61篇 |
2022年 | 86篇 |
2021年 | 62篇 |
2020年 | 122篇 |
2019年 | 115篇 |
2018年 | 119篇 |
2017年 | 111篇 |
2016年 | 81篇 |
2015年 | 87篇 |
2014年 | 136篇 |
2013年 | 308篇 |
2012年 | 120篇 |
2011年 | 191篇 |
2010年 | 187篇 |
2009年 | 331篇 |
2008年 | 269篇 |
2007年 | 217篇 |
2006年 | 196篇 |
2005年 | 133篇 |
2004年 | 123篇 |
2003年 | 116篇 |
2002年 | 107篇 |
2001年 | 88篇 |
2000年 | 83篇 |
1999年 | 71篇 |
1998年 | 71篇 |
1997年 | 60篇 |
1996年 | 39篇 |
1995年 | 19篇 |
1994年 | 20篇 |
1993年 | 20篇 |
1992年 | 14篇 |
1991年 | 8篇 |
1990年 | 17篇 |
1989年 | 15篇 |
1988年 | 14篇 |
1987年 | 2篇 |
1986年 | 6篇 |
1985年 | 13篇 |
1984年 | 10篇 |
1983年 | 4篇 |
1982年 | 6篇 |
1981年 | 5篇 |
1980年 | 2篇 |
1979年 | 1篇 |
1978年 | 2篇 |
1977年 | 1篇 |
1970年 | 2篇 |
1959年 | 1篇 |
排序方式: 共有3885条查询结果,搜索用时 31 毫秒
91.
92.
《Discrete Mathematics》2023,346(4):113288
Square coloring is a variant of graph coloring where vertices within distance two must receive different colors. When considering planar graphs, the most famous conjecture (Wegner, 1977) states that colors are sufficient to square color every planar graph of maximum degree Δ. This conjecture has been proven asymptotically for graphs with large maximum degree. We consider here planar graphs with small maximum degree and show that colors are sufficient, which improves the best known bounds when . 相似文献
93.
94.
We prove several improved versions of Bohr’s inequality for the harmonic mappings of the form , where is bounded by 1 and . The improvements are obtained along the lines of an earlier work of Kayumov and Ponnusamy, i.e. (Kayumov and Ponnusamy, 2018) for example a term related to the area of the image of the disk under the mapping is considered. Our results are sharp. In addition, further improvements of the main results for certain special classes of harmonic mappings are provided. 相似文献
95.
David Ellison 《Discrete Mathematics》2019,342(3):917-925
In the game of cops and robbers on graphs, the cops and the robber are allowed to pass their turn if they are located on a looped vertex. This paper explores the effect of loops on the cop number and the capture time. We provide examples of graphs where the cop number almost doubles when the loops are removed, graphs where the cop number decreases when the loops are removed, graphs where the capture time is quadratic in the number of vertices and copwin graphs where the cop needs to move away from the robber in optimal play. 相似文献
96.
In this article we will apply the first- and second-order supersymmetric quantum mechanics to obtain new exactly-solvable real potentials departing from the inverted oscillator potential. This system has some special properties; in particular, only very specific second-order transformations produce non-singular real potentials. It will be shown that these transformations turn out to be the so-called complex ones. Moreover, we will study the factorization method applied to the inverted oscillator and the algebraic structure of the new Hamiltonians. 相似文献
97.
C.M. da Fonseca Dan A. Mazilu Irina Mazilu H. Thomas Williams 《Applied Mathematics Letters》2013,26(12):1206-1211
A straightforward model for deposition and evaporation on discrete cells of a finite array of any dimension leads to a matrix equation involving a Sylvester–Kac type matrix. The eigenvalues and eigenvectors of the general matrix are determined for an arbitrary number of cells. A variety of models to which this solution may be applied are discussed. 相似文献
98.
99.
A graph is -colorable if it admits a vertex partition into a graph with maximum degree at most and a graph with maximum degree at most . We show that every -free planar graph is -colorable. We also show that deciding whether a -free planar graph is -colorable is NP-complete. 相似文献
100.
In 1977 the celebrated theorem of B. Dahlberg established that the harmonic measure is absolutely continuous with respect to the Hausdorff measure on a Lipschitz graph of dimension in , and later this result has been extended to more general non-tangentially accessible domains and beyond.In the present paper we prove the first analogue of Dahlberg's theorem in higher co-dimension, on a Lipschitz graph Γ of dimension d in , , with a small Lipschitz constant. We construct a linear degenerate elliptic operator L such that the corresponding harmonic measure is absolutely continuous with respect to the Hausdorff measure on Γ. More generally, we provide sufficient conditions on the matrix of coefficients of L which guarantee the mutual absolute continuity of and the Hausdorff measure. 相似文献