全文获取类型
收费全文 | 1690篇 |
免费 | 105篇 |
国内免费 | 104篇 |
专业分类
化学 | 145篇 |
力学 | 25篇 |
综合类 | 52篇 |
数学 | 1457篇 |
物理学 | 220篇 |
出版年
2024年 | 2篇 |
2023年 | 19篇 |
2022年 | 47篇 |
2021年 | 36篇 |
2020年 | 50篇 |
2019年 | 57篇 |
2018年 | 49篇 |
2017年 | 54篇 |
2016年 | 47篇 |
2015年 | 39篇 |
2014年 | 63篇 |
2013年 | 138篇 |
2012年 | 55篇 |
2011年 | 82篇 |
2010年 | 96篇 |
2009年 | 105篇 |
2008年 | 142篇 |
2007年 | 112篇 |
2006年 | 110篇 |
2005年 | 54篇 |
2004年 | 75篇 |
2003年 | 64篇 |
2002年 | 51篇 |
2001年 | 52篇 |
2000年 | 38篇 |
1999年 | 40篇 |
1998年 | 43篇 |
1997年 | 21篇 |
1996年 | 25篇 |
1995年 | 17篇 |
1994年 | 16篇 |
1993年 | 13篇 |
1992年 | 8篇 |
1991年 | 12篇 |
1990年 | 12篇 |
1989年 | 8篇 |
1988年 | 1篇 |
1987年 | 3篇 |
1986年 | 11篇 |
1985年 | 4篇 |
1984年 | 7篇 |
1983年 | 2篇 |
1982年 | 9篇 |
1981年 | 5篇 |
1980年 | 1篇 |
1979年 | 2篇 |
1971年 | 1篇 |
1957年 | 1篇 |
排序方式: 共有1899条查询结果,搜索用时 15 毫秒
1.
2.
3.
A graph is called supereulerian if it has a spanning closed trail. Let G be a 2-edge-connected graph of order n such that each minimal edge cut SE(G) with |S|3 satisfies the property that each component of G−S has order at least (n−2)/5. We prove that either G is supereulerian or G belongs to one of two classes of exceptional graphs. Our results slightly improve earlier results of Catlin and Li. Furthermore, our main result implies the following strengthening of a theorem of Lai within the class of graphs with minimum degree δ4: If G is a 2-edge-connected graph of order n with δ(G)4 such that for every edge xyE(G) , we have max{d(x),d(y)}(n−2)/5−1, then either G is supereulerian or G belongs to one of two classes of exceptional graphs. We show that the condition δ(G)4 cannot be relaxed. 相似文献
4.
Annegret K. Wagler 《Mathematical Methods of Operations Research》2002,56(1):127-149
An edge e of a perfect graph G is critical if G−e is imperfect. We would like to decide whether G−e is still “almost perfect” or already “very imperfect”. Via relaxations of the stable set polytope of a graph, we define two
superclasses of perfect graphs: rank-perfect and weakly rank-perfect graphs. Membership in those two classes indicates how
far an imperfect graph is away from being perfect. We study the cases, when a critical edge is removed from the line graph
of a bipartite graph or from the complement of such a graph. 相似文献
5.
A Necessary and Sufficient Condition for the Existence of a Heterochromatic Spanning Tree in a Graph
Kazuhiro Suzuki 《Graphs and Combinatorics》2006,22(2):261-269
We prove the following theorem. An edge-colored (not necessary to be proper) connected graph G of order n has a heterochromatic spanning tree if and only if for any r colors (1≤r≤n−2), the removal of all the edges colored with these r colors from G results in a graph having at most r+1 components, where a heterochromatic spanning tree is a spanning tree whose edges have distinct colors. 相似文献
6.
Given a tree
with leaf set X, there are certain ways of arranging the elements of X in a circular order so that
can be embedded in the plane and ‘preserve’ this ordering. We investigate some new combinatorial properties of these ‘circular orderings.’ We then use these properties to establish two results concerning dissimilarity maps on X that are induced by edge-weighted trees with leaf set X. 相似文献
7.
8.
9.
M. A. Bertolim M. P. Mello K. A. de Rezende 《Transactions of the American Mathematical Society》2005,357(10):4091-4129
In this article the main theorem establishes the necessity and sufficiency of the Poincaré-Hopf inequalities in order for the Morse inequalities to hold. The convex hull of the collection of all Betti number vectors which satisfy the Morse inequalities for a pre-assigned index data determines a Morse polytope defined on the nonnegative orthant. Using results from network flow theory, a scheme is provided for constructing all possible Betti number vectors which satisfy the Morse inequalities for a pre-assigned index data. Geometrical properties of this polytope are described.
10.
Searching in trees 总被引:1,自引:0,他引:1
Frank Recker 《Discrete Applied Mathematics》2004,140(1-3):169-183
In (Discrete Math. 17 (1977)181) Rivest introduced the search complexity of binary trees and proved that among all binary trees with a fixed search complexity the smallest ones are the so-called Fibonacci trees. This result is extended for q-trees. The structure of the smallest q-trees is again Fibonacci-like but more complicated than in the binary case. In addition an upper bound for the asymptotic growth of these trees is given. 相似文献