全文获取类型
收费全文 | 1129篇 |
免费 | 87篇 |
国内免费 | 90篇 |
专业分类
化学 | 130篇 |
力学 | 17篇 |
综合类 | 9篇 |
数学 | 1029篇 |
物理学 | 121篇 |
出版年
2024年 | 2篇 |
2023年 | 9篇 |
2022年 | 16篇 |
2021年 | 26篇 |
2020年 | 28篇 |
2019年 | 34篇 |
2018年 | 38篇 |
2017年 | 27篇 |
2016年 | 34篇 |
2015年 | 24篇 |
2014年 | 46篇 |
2013年 | 104篇 |
2012年 | 57篇 |
2011年 | 61篇 |
2010年 | 59篇 |
2009年 | 118篇 |
2008年 | 91篇 |
2007年 | 68篇 |
2006年 | 71篇 |
2005年 | 50篇 |
2004年 | 52篇 |
2003年 | 43篇 |
2002年 | 35篇 |
2001年 | 33篇 |
2000年 | 42篇 |
1999年 | 21篇 |
1998年 | 30篇 |
1997年 | 12篇 |
1996年 | 15篇 |
1995年 | 14篇 |
1994年 | 11篇 |
1993年 | 8篇 |
1992年 | 2篇 |
1991年 | 2篇 |
1990年 | 3篇 |
1989年 | 3篇 |
1987年 | 1篇 |
1986年 | 2篇 |
1985年 | 2篇 |
1984年 | 3篇 |
1983年 | 1篇 |
1982年 | 2篇 |
1981年 | 1篇 |
1979年 | 3篇 |
1977年 | 1篇 |
1974年 | 1篇 |
排序方式: 共有1306条查询结果,搜索用时 640 毫秒
1.
2.
3.
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. 相似文献
4.
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 相似文献
5.
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 相似文献
6.
A. J. Zaslavski 《Journal of Optimization Theory and Applications》2004,123(3):695-712
In our previous work, a generic well-posedness result (with respect to variations of the integrand of the integral functional) without the convexity condition was established for a class of optimal control problems satisfying the Cesari growth condition. In this paper, we extend this generic well-posedness result to classes of constrained variational problems in which the values at the endpoints and constraint maps are also subject to variations. 相似文献
7.
该文利用算子半群的方法给出了取值于具有左不变度量的完备可分群的齐次Levy过程是复合Poisson过程的弱极限这一结论. 相似文献
8.
Zhu Linsheng 《东北数学》1998,(1)
in this paper, the classification and realization of complete Lie algebras withcommutative nilpotent radicals are given. From this, some results on the radicals of thesecomplete Lie algebras are obtained. 相似文献
9.
Zhu Da xin 《数学年刊B辑(英文版)》1994,15(3):293-298
ACOMPLETEMETRICOFPOSITIVECURVATUREONR~nANDEXISTENCEOFCLOSEDGEODESICS¥ZHUDAXIN(DepartmentofMathematics,TianjinUniversitylTianj?.. 相似文献
10.
Brian Lucena 《Discrete Applied Mathematics》2007,155(8):1055-1065
One consequence of the graph minor theorem is that for every k there exists a finite obstruction set Obs(TW?k). However, relatively little is known about these sets, and very few general obstructions are known. The ones that are known are the cliques, and graphs which are formed by removing a few edges from a clique. This paper gives several general constructions of minimal forbidden minors which are sparse in the sense that the ratio of the treewidth to the number of vertices n does not approach 1 as n approaches infinity. We accomplish this by a novel combination of using brambles to provide lower bounds and achievable sets to demonstrate upper bounds. Additionally, we determine the exact treewidth of other basic graph constructions which are not minimal forbidden minors. 相似文献