全文获取类型
收费全文 | 2416篇 |
免费 | 159篇 |
国内免费 | 74篇 |
专业分类
化学 | 74篇 |
晶体学 | 1篇 |
力学 | 4篇 |
综合类 | 29篇 |
数学 | 2435篇 |
物理学 | 106篇 |
出版年
2024年 | 10篇 |
2023年 | 46篇 |
2022年 | 68篇 |
2021年 | 45篇 |
2020年 | 98篇 |
2019年 | 92篇 |
2018年 | 86篇 |
2017年 | 83篇 |
2016年 | 57篇 |
2015年 | 47篇 |
2014年 | 81篇 |
2013年 | 207篇 |
2012年 | 68篇 |
2011年 | 125篇 |
2010年 | 127篇 |
2009年 | 231篇 |
2008年 | 185篇 |
2007年 | 138篇 |
2006年 | 145篇 |
2005年 | 86篇 |
2004年 | 84篇 |
2003年 | 82篇 |
2002年 | 69篇 |
2001年 | 57篇 |
2000年 | 56篇 |
1999年 | 51篇 |
1998年 | 44篇 |
1997年 | 37篇 |
1996年 | 22篇 |
1995年 | 7篇 |
1994年 | 13篇 |
1993年 | 13篇 |
1992年 | 8篇 |
1991年 | 8篇 |
1990年 | 11篇 |
1989年 | 11篇 |
1988年 | 9篇 |
1987年 | 3篇 |
1986年 | 3篇 |
1985年 | 11篇 |
1984年 | 10篇 |
1983年 | 3篇 |
1982年 | 4篇 |
1981年 | 2篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1978年 | 2篇 |
1977年 | 1篇 |
1970年 | 1篇 |
排序方式: 共有2649条查询结果,搜索用时 46 毫秒
111.
This is a summary of the most important results presented in the authors PhD thesis (Spanjaard 2003). This thesis, written in French, was defended on 16 December 2003 and supervised by Patrice Perny. A copy is available from the author upon request. This thesis deals with the search for preferred solutions in combinatorial optimization problems (and more particularly graph problems). It aims at conciliating preference modelling and algorithmic concerns for decision aiding.Received: March 2004, MSC classification:
91B06, 90C27, 90B40, 16Y60 相似文献
112.
The main theme of this paper is that almost fixed point properties of discrete structures and fixed point properties of (topological) spaces are interdeducible via a suitable category which contains both graphs and spaces as objects. To carry out the program, we have to consider (almost) fixed points of multifunctions, and for this we need a preliminary discussion of power structures for graphs and simplicial complexes. Specific applications developed are: a digital convexity (discrete) version of Kakutani's fixed point theorem for convex-valued multifunctions; and fixed point properties of dendrites in terms of those of finite discrete trees. 相似文献
113.
It is shown that every probability measure on the interval [0, 1] gives rise
to a unique infinite random graph g on vertices
{v1,
v2, . . .}
and a sequence of random graphs gn on vertices
{v1, . . . ,
vn}
such that
.
In particular,
for Bernoulli graphs with
stable property Q,
can be strengthened to: probability space (, F, P),
set of infinite graphs
G(Q) ,
F with property Q such
that
.AMS Subject Classification: 05C80, 05C62. 相似文献
114.
In this article we study Hamilton cycles in sparse pseudo‐random graphs. We prove that if the second largest absolute value λ of an eigenvalue of a d‐regular graph G on n vertices satisfies and n is large enough, then G is Hamiltonian. We also show how our main result can be used to prove that for every c >0 and large enough n a Cayley graph X (G,S), formed by choosing a set S of c log5 n random generators in a group G of order n, is almost surely Hamiltonian. © 2002 Wiley Periodicals, Inc. J Graph Theory 42: 17–33, 2003 相似文献
115.
Let P
k be a path on k vertices. In an earlier paper we have proved that each polyhedral map G on any compact 2-manifold
with Euler characteristic
contains a path P
k such that each vertex of this path has, in G, degree
. Moreover, this bound is attained for k = 1 or k 2, k even. In this paper we prove that for each odd
, this bound is the best possible on infinitely many compact 2-manifolds, but on infinitely many other compact 2-manifolds the upper bound can be lowered to
. 相似文献
116.
Let f be a smooth nondegenerate real valued function on a finite dimensional, compact and connected Riemannian manifold. The bipartite min-max graph is defined as follows. Its nodes are formed by the set of local minima and the set of local maxima. Two nodes (a local minimum and a local maximum) are connected in by means of an edge if some trajectory of the corresponding gradient flow connects them. Given a natural number k, we construct a function f such that the length of the shortest path in between two specific local minima exceeds k. The latter construction is independent of the underlying Riemannian metric. 相似文献
117.
In this paper we present a lower bound of the disjunctive rank of the facets describing the stable set polytope of joined a-perfect graphs. This class contains near-bipartite, t-perfect, h-perfect and complement of fuzzy interval graphs, among others. The stable set polytope of joined a-perfect graphs is described by means of full rank constraints of its node induced prime antiwebs. As a first step, we completely determine the disjunctive rank of all these constraints. Using this result we obtain a lower bound of the disjunctive index of joined a-perfect graphs and prove that this bound can be achieved. In addition, we completely determine the disjunctive index of every antiweb and observe that it does not always coincide with the disjunctive rank of its full rank constraint. 相似文献
118.
119.
It is well-known that a 2-edge-connected cubic graph has a 3-edge-colouring if and only if it has a 4-flow. Snarks are usually regarded to be, in some sense, the minimal cubic graphs without a 3-edge-colouring. We defined the notion of 4-flow-critical graphs as an alternative concept towards minimal graphs. It turns out that every snark has a 4-flow-critical snark as a minor. We verify, surprisingly, that less than 5% of the snarks with up to 28 vertices are 4-flow-critical. On the other hand, there are infinitely many 4-flow-critical snarks, as every flower-snark is 4-flow-critical. These observations give some insight into a new research approach regarding Tutteʼs Flow Conjectures. 相似文献
120.
We show that every plane graph with maximum face size four in which all faces of size four are vertex‐disjoint is cyclically 5‐colorable. This answers a question of Albertson whether graphs drawn in the plane with all crossings independent are 5‐colorable. © 2009 Wiley Periodicals, Inc. J Graph Theory 64: 184–205, 2010 相似文献