全文获取类型
收费全文 | 6099篇 |
免费 | 426篇 |
国内免费 | 430篇 |
专业分类
化学 | 404篇 |
晶体学 | 4篇 |
力学 | 49篇 |
综合类 | 139篇 |
数学 | 5758篇 |
物理学 | 601篇 |
出版年
2024年 | 26篇 |
2023年 | 119篇 |
2022年 | 190篇 |
2021年 | 146篇 |
2020年 | 223篇 |
2019年 | 252篇 |
2018年 | 243篇 |
2017年 | 208篇 |
2016年 | 155篇 |
2015年 | 116篇 |
2014年 | 229篇 |
2013年 | 516篇 |
2012年 | 239篇 |
2011年 | 346篇 |
2010年 | 358篇 |
2009年 | 505篇 |
2008年 | 438篇 |
2007年 | 327篇 |
2006年 | 345篇 |
2005年 | 264篇 |
2004年 | 228篇 |
2003年 | 198篇 |
2002年 | 182篇 |
2001年 | 172篇 |
2000年 | 153篇 |
1999年 | 152篇 |
1998年 | 144篇 |
1997年 | 92篇 |
1996年 | 66篇 |
1995年 | 64篇 |
1994年 | 48篇 |
1993年 | 30篇 |
1992年 | 33篇 |
1991年 | 17篇 |
1990年 | 16篇 |
1989年 | 17篇 |
1988年 | 15篇 |
1987年 | 9篇 |
1986年 | 6篇 |
1985年 | 14篇 |
1984年 | 15篇 |
1983年 | 5篇 |
1982年 | 12篇 |
1981年 | 4篇 |
1980年 | 7篇 |
1978年 | 1篇 |
1977年 | 2篇 |
1976年 | 2篇 |
1975年 | 3篇 |
1974年 | 2篇 |
排序方式: 共有6955条查询结果,搜索用时 15 毫秒
41.
Louis Block James Keesling Shihai Li Kevin Peterson 《Journal of statistical physics》1989,55(5-6):929-939
A new algorithm is presented for computing the topological entropy of a unimodal map of the interval. The accuracy of the algorithm is discussed and some graphs of the topological entropy which are obtained using the algorithm are displayed. 相似文献
42.
43.
44.
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 相似文献
45.
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. 相似文献
46.
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. 相似文献
47.
K. Gowri Navada 《Proceedings Mathematical Sciences》1995,105(3):281-285
We give an estimate for the number of elements in the intersection of topological Sidon sets inR
n with compact convex subsets and deduce a necessary and sufficient conditions for an orbit of a linear transformation ofR
n to be a topological Sidon set. 相似文献
48.
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 相似文献
49.
For each infinite cardinal κ, we give examples of 2κ many non‐isomorphic vertex‐transitive graphs of order κ that are pairwise isomorphic to induced subgraphs of each other. We consider examples of graphs with these properties that are also universal, in the sense that they embed all graphs with smaller orders as induced subgraphs. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 99–106, 2003 相似文献
50.