全文获取类型
收费全文 | 2005篇 |
免费 | 37篇 |
国内免费 | 107篇 |
专业分类
化学 | 89篇 |
晶体学 | 2篇 |
力学 | 23篇 |
综合类 | 17篇 |
数学 | 1947篇 |
物理学 | 71篇 |
出版年
2023年 | 35篇 |
2022年 | 32篇 |
2021年 | 29篇 |
2020年 | 41篇 |
2019年 | 77篇 |
2018年 | 44篇 |
2017年 | 35篇 |
2016年 | 23篇 |
2015年 | 33篇 |
2014年 | 56篇 |
2013年 | 157篇 |
2012年 | 65篇 |
2011年 | 125篇 |
2010年 | 113篇 |
2009年 | 186篇 |
2008年 | 168篇 |
2007年 | 118篇 |
2006年 | 111篇 |
2005年 | 58篇 |
2004年 | 61篇 |
2003年 | 63篇 |
2002年 | 55篇 |
2001年 | 62篇 |
2000年 | 53篇 |
1999年 | 36篇 |
1998年 | 42篇 |
1997年 | 38篇 |
1996年 | 33篇 |
1995年 | 26篇 |
1994年 | 21篇 |
1993年 | 17篇 |
1992年 | 17篇 |
1991年 | 13篇 |
1990年 | 9篇 |
1989年 | 3篇 |
1988年 | 7篇 |
1987年 | 7篇 |
1986年 | 14篇 |
1985年 | 8篇 |
1984年 | 9篇 |
1983年 | 5篇 |
1982年 | 11篇 |
1981年 | 9篇 |
1980年 | 5篇 |
1979年 | 3篇 |
1978年 | 4篇 |
1977年 | 5篇 |
1976年 | 5篇 |
1974年 | 1篇 |
1972年 | 1篇 |
排序方式: 共有2149条查询结果,搜索用时 78 毫秒
1.
We describe a unified approach for studying book, point-set, and simultaneous embeddability problems of upward planar digraphs. The approach is based on a linear time strategy to compute an upward planar drawing of an upward planar digraph such that all vertices are collinear. Besides having impact in relevant application domains of graph drawing and computational geometry, the presented results open new research directions in the area of upward planarity with constraints of the positions of the vertices. 相似文献
2.
3.
4.
5.
6.
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. 相似文献
7.
本文指出 M.Jahangiri的评论[Mathematical Reviews 98e:30020]错误,并且导出解析函数p叶星形性与p叶凸性的某些充分条件. 相似文献
8.
Rossella Bartolo Anna Germinario Miguel Sánchez 《Annals of Global Analysis and Geometry》2002,21(1):63-84
In this paper the problem of the geodesic connectedness and convexity ofincomplete Riemannian manifolds is analyzed. To this aim, a detailedstudy of the notion of convexity for the associated Cauchy boundary iscarried out. In particular, under widely discussed hypotheses,we prove the convexity of open domains (whose boundaries may benondifferentiable) of a complete Riemannian manifold. Variationalmethods are mainly used. Examples and applications are provided,including a result for dynamical systems on the existence oftrajectories with fixed energy. 相似文献
9.
We introduce extensions of the Mangasarian-Fromovitz and Abadie constraint qualifications to nonsmooth optimization problems with feasibility given by means of lower-level sets. We do not assume directional differentiability, but only upper semicontinuity of the defining functions. By deriving and reviewing primal first-order optimality conditions for nonsmooth problems, we motivate the formulations of the constraint qualifications. Then, we study their interrelation, and we show how they are related to the Slater condition for nonsmooth convex problems, to nonsmooth reverse-convex problems, to the stability of parametric feasible set mappings, and to alternative theorems for the derivation of dual first-order optimality conditions.In the literature on general semi-infinite programming problems, a number of formally different extensions of the Mangasarian-Fromovitz constraint qualification have been introduced recently under different structural assumptions. We show that all these extensions are unified by the constraint qualification presented here. 相似文献
10.
A generalization of strong regularity around a vertex subset C of a graph Γ, which makes sense even if Γis non-regular, is studied. Such a structure appears, together with a kind of distance-regularity around C , when an spectral bound concerning the so-called predistance polynomial of C is attained. As a main consequence of these results, it is shown that a regular (connected) graph Γwith d + 1 distinct eigenvalues is distance-regular, and its distance- d graph Γ d is strongly regular with parameters a = c , if and only if the number of vertices at distance d from each vertex satisfies an expression which depends only on the order of Γand the different eigenvalues of Γ. 相似文献