全文获取类型
收费全文 | 6401篇 |
免费 | 474篇 |
国内免费 | 413篇 |
专业分类
化学 | 746篇 |
晶体学 | 7篇 |
力学 | 108篇 |
综合类 | 171篇 |
数学 | 5692篇 |
物理学 | 564篇 |
出版年
2024年 | 26篇 |
2023年 | 108篇 |
2022年 | 183篇 |
2021年 | 147篇 |
2020年 | 211篇 |
2019年 | 242篇 |
2018年 | 233篇 |
2017年 | 232篇 |
2016年 | 145篇 |
2015年 | 109篇 |
2014年 | 212篇 |
2013年 | 508篇 |
2012年 | 233篇 |
2011年 | 344篇 |
2010年 | 345篇 |
2009年 | 486篇 |
2008年 | 446篇 |
2007年 | 345篇 |
2006年 | 383篇 |
2005年 | 266篇 |
2004年 | 251篇 |
2003年 | 215篇 |
2002年 | 322篇 |
2001年 | 200篇 |
2000年 | 175篇 |
1999年 | 166篇 |
1998年 | 142篇 |
1997年 | 103篇 |
1996年 | 71篇 |
1995年 | 68篇 |
1994年 | 60篇 |
1993年 | 52篇 |
1992年 | 39篇 |
1991年 | 26篇 |
1990年 | 21篇 |
1989年 | 25篇 |
1988年 | 21篇 |
1987年 | 15篇 |
1986年 | 4篇 |
1985年 | 17篇 |
1984年 | 20篇 |
1983年 | 5篇 |
1982年 | 20篇 |
1981年 | 8篇 |
1980年 | 9篇 |
1979年 | 6篇 |
1977年 | 5篇 |
1976年 | 5篇 |
1975年 | 4篇 |
1974年 | 4篇 |
排序方式: 共有7288条查询结果,搜索用时 0 毫秒
1.
We examine two criteria for balance of a gain graph, one based on binary cycles and one on circles. The graphs for which each criterion is valid depend on the set of allowed gain groups. The binary cycle test is invalid, except for forests, if any possible gain group has an element of odd order. Assuming all groups are allowed, or all abelian groups, or merely the cyclic group of order 3, we characterize, both constructively and by forbidden minors, the graphs for which the circle test is valid. It turns out that these three classes of groups have the same set of forbidden minors. The exact reason for the importance of the ternary cyclic group is not clear. © 2005 Wiley Periodicals, Inc. J Graph Theory 相似文献
2.
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 相似文献
3.
Francis K. Bell 《Journal of Graph Theory》2003,43(2):137-149
It is shown that, if t is an integer ≥3 and not equal to 7 or 8, then there is a unique maximal graph having the path Pt as a star complement for the eigenvalue ?2. The maximal graph is the line graph of Km,m if t = 2m?1, and of Km,m+1 if t = 2m. This result yields a characterization of L(G ) when G is a (t + 1)‐vertex bipartite graph with a Hamiltonian path. The graphs with star complement Pr ∪ Ps or Pr ∪ Cs for ?2 are also determined. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 137–149, 2003 相似文献
4.
本文首先提出逆(反)对策这一新问题,给出了数学模型;探讨了“奇门遁甲”预测理论(术)中的数学问题;通过系统分析“专门遁甲”预测过程,可知它的预测过程隐含着一个特殊的逆(反)对策问题;最后指出逆(反)对策问题的广泛存在并给出案例分析. 相似文献
5.
An m‐covering of a graph G is a spanning subgraph of G with maximum degree at most m. In this paper, we shall show that every 3‐connected graph on a surface with Euler genus k ≥ 2 with sufficiently large representativity has a 2‐connected 7‐covering with at most 6k ? 12 vertices of degree 7. We also construct, for every surface F2 with Euler genus k ≥ 2, a 3‐connected graph G on F2 with arbitrarily large representativity each of whose 2‐connected 7‐coverings contains at least 6k ? 12 vertices of degree 7. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 26–36, 2003 相似文献
6.
7.
8.
1989年发表的Bager第五图,包含关于三角形元素的35个二次规范画数之间的51个不等式通过细致的分析,本文给出了其中遗漏的12个基本不等式 相似文献
9.
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 相似文献
10.
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. 相似文献