全文获取类型
收费全文 | 9972篇 |
免费 | 924篇 |
国内免费 | 863篇 |
专业分类
化学 | 1535篇 |
晶体学 | 46篇 |
力学 | 1128篇 |
综合类 | 241篇 |
数学 | 5791篇 |
物理学 | 3018篇 |
出版年
2024年 | 22篇 |
2023年 | 122篇 |
2022年 | 255篇 |
2021年 | 237篇 |
2020年 | 291篇 |
2019年 | 271篇 |
2018年 | 274篇 |
2017年 | 350篇 |
2016年 | 371篇 |
2015年 | 260篇 |
2014年 | 470篇 |
2013年 | 718篇 |
2012年 | 446篇 |
2011年 | 575篇 |
2010年 | 503篇 |
2009年 | 696篇 |
2008年 | 681篇 |
2007年 | 663篇 |
2006年 | 617篇 |
2005年 | 556篇 |
2004年 | 422篇 |
2003年 | 392篇 |
2002年 | 358篇 |
2001年 | 281篇 |
2000年 | 293篇 |
1999年 | 265篇 |
1998年 | 275篇 |
1997年 | 197篇 |
1996年 | 158篇 |
1995年 | 96篇 |
1994年 | 101篇 |
1993年 | 75篇 |
1992年 | 64篇 |
1991年 | 67篇 |
1990年 | 48篇 |
1989年 | 36篇 |
1988年 | 43篇 |
1987年 | 28篇 |
1986年 | 33篇 |
1985年 | 28篇 |
1984年 | 23篇 |
1983年 | 7篇 |
1982年 | 20篇 |
1981年 | 14篇 |
1980年 | 11篇 |
1979年 | 11篇 |
1978年 | 10篇 |
1977年 | 4篇 |
1974年 | 3篇 |
1972年 | 4篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
1.
2.
Christian Bosse 《Discrete Mathematics》2019,342(12):111595
The Hadwiger number of a graph , denoted , is the largest integer such that contains as a minor. A famous conjecture due to Hadwiger in 1943 states that for every graph , , where denotes the chromatic number of . Let denote the independence number of . A graph is -free if it does not contain the graph as an induced subgraph. In 2003, Plummer, Stiebitz and Toft proved that for all -free graphs with , where is any graph on four vertices with , , or is a particular graph on seven vertices. In 2010, Kriesell subsequently generalized the statement to include all forbidden subgraphs on five vertices with . In this note, we prove that for all -free graphs with , where denotes the wheel on six vertices. 相似文献
3.
Necessary conditions for the Gâteaux differentiability of the distance function to a set are considered. A series of characterizing results is obtained. 相似文献
4.
Let ir(G) and γ(G) be the irredundance number and the domination number of a graph G, respectively. A graph G is called irredundance perfect if ir(H)=γ(H), for every induced subgraph H of G. In this article we present a result which immediately implies three known conjectures on irredundance perfect graphs. © 2002 Wiley Periodicals, Inc. J Graph Theory 41: 292–306, 2002 相似文献
5.
6.
A new speckle shearing interferometer with simple setup is proposed. The interferometer can be converted easily from a speckle referenced speckle pattern interferometer into a speckle shearing interferometer and vice versa. A beamsplitter and a mirror are used to generate the shear. The amount of shear can be adjusted by simply rotating the mirror. The costs involved are low and it is particularly useful for fast inspection in non-destructive testing of structural integrity. Both the theoretical studies of the method of measurement and the experimental results are presented. 相似文献
7.
A. Khrennikov 《Annalen der Physik》2003,12(10):575-585
We study the probabilistic consequences of the choice of the basic number field in the quantum formalism. We demonstrate that by choosing a number field for a linear space representation of quantum model it is possible to describe various interference phenomena. We analyse interference of probabilistic alternatives induced by real, complex, hyperbolic (Clifford) and p‐adic representations. 相似文献
8.
9.
Zuo LIU Zhen De WU 《数学学报(英文版)》2005,21(5):997-1000
Let κ be non-negative integer. The unoriented bordism classes, which can be represented as [RP(ξ^κ)] where ξ^κ is a k-plane bundle, form an ideal of the unoriented bordism ring MO.. A group of generators of this ideal expressed by a base of MO. and a necessary and sufficient condition for a bordism class to belong to this ideal are given. 相似文献
10.
Xuding Zhu 《Journal of Graph Theory》2005,48(3):186-209
For 1 ≤ d ≤ k, let Kk/d be the graph with vertices 0, 1, …, k ? 1, in which i ~j if d ≤ |i ? j| ≤ k ? d. The circular chromatic number χc(G) of a graph G is the minimum of those k/d for which G admits a homomorphism to Kk/d. The circular clique number ωc(G) of G is the maximum of those k/d for which Kk/d admits a homomorphism to G. A graph G is circular perfect if for every induced subgraph H of G, we have χc(H) = ωc(H). In this paper, we prove that if G is circular perfect then for every vertex x of G, NG[x] is a perfect graph. Conversely, we prove that if for every vertex x of G, NG[x] is a perfect graph and G ? N[x] is a bipartite graph with no induced P5 (the path with five vertices), then G is a circular perfect graph. In a companion paper, we apply the main result of this paper to prove an analog of Haj?os theorem for circular chromatic number for k/d ≥ 3. Namely, we shall design a few graph operations and prove that for any k/d ≥ 3, starting from the graph Kk/d, one can construct all graphs of circular chromatic number at least k/d by repeatedly applying these graph operations. © 2005 Wiley Periodicals, Inc. J Graph Theory 48: 186–209, 2005 相似文献