全文获取类型
收费全文 | 2338篇 |
免费 | 333篇 |
国内免费 | 161篇 |
专业分类
化学 | 564篇 |
晶体学 | 20篇 |
力学 | 194篇 |
综合类 | 68篇 |
数学 | 1067篇 |
物理学 | 919篇 |
出版年
2024年 | 2篇 |
2023年 | 30篇 |
2022年 | 74篇 |
2021年 | 64篇 |
2020年 | 84篇 |
2019年 | 71篇 |
2018年 | 78篇 |
2017年 | 91篇 |
2016年 | 91篇 |
2015年 | 54篇 |
2014年 | 112篇 |
2013年 | 206篇 |
2012年 | 123篇 |
2011年 | 163篇 |
2010年 | 141篇 |
2009年 | 172篇 |
2008年 | 178篇 |
2007年 | 145篇 |
2006年 | 126篇 |
2005年 | 109篇 |
2004年 | 115篇 |
2003年 | 90篇 |
2002年 | 75篇 |
2001年 | 67篇 |
2000年 | 59篇 |
1999年 | 52篇 |
1998年 | 37篇 |
1997年 | 32篇 |
1996年 | 30篇 |
1995年 | 27篇 |
1994年 | 15篇 |
1993年 | 17篇 |
1992年 | 19篇 |
1991年 | 15篇 |
1990年 | 13篇 |
1989年 | 10篇 |
1988年 | 8篇 |
1987年 | 10篇 |
1986年 | 7篇 |
1985年 | 2篇 |
1984年 | 5篇 |
1983年 | 2篇 |
1982年 | 3篇 |
1981年 | 1篇 |
1980年 | 2篇 |
1979年 | 2篇 |
1978年 | 2篇 |
1976年 | 1篇 |
排序方式: 共有2832条查询结果,搜索用时 15 毫秒
1.
A (di)graph is supereulerian if it contains a spanning eulerian sub(di)graph. This property is a relaxation of hamiltonicity. Inspired by this analogy with hamiltonian cycles and by similar results in supereulerian graph theory, we analyze a number of sufficient Ore type conditions for a digraph to be supereulerian. Furthermore, we study the following conjecture due to Thomassé and the first author: if the arc‐connectivity of a digraph is not smaller than its independence number, then the digraph is supereulerian. As a support for this conjecture we prove it for digraphs that are semicomplete multipartite or quasitransitive and verify the analogous statement for undirected graphs. 相似文献
2.
本文在一类 Lp位势V(x)下建立了广义Schrodinger算子H=(-Δ)m+V(x)在C∞0(Rn)上的本质自伴性,给出了H的本质谱的分布. 相似文献
3.
Olaf Hansen 《Mathematical Methods in the Applied Sciences》2002,25(12):1075-1090
In this article we study the radiosity operator along an edge between two adjacent half‐planes. First we show that the radiosity operator is invertible in a whole scale of anisotropic Sobolev spaces. In the absence of any shadows we are able to derive regularity properties of the solution, which depend only on the angle between the half‐planes, the reflectivity coefficients and the right‐hand side. This work can be considered as a supplement to the article of Rathsfeld (Mathematical Methods in the Applied Sciences 1999; 22 : 217–241). Copyright © 2002 John Wiley & Sons, Ltd. 相似文献
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.
6.
《组合设计杂志》2002,10(5):283-293
An Orthogonal Double Cover (ODC) of the complete graph Kn by an almost‐hamiltonian cycle is a decomposition of 2Kn into cycles of length n?1 such that the intersection of any two of them is exactly one edge. We introduce a new class of such decompositions. If n is a prime, the special structure of such a decomposition allows to expand it to an ODC of Kn+1 by an almost‐hamiltonian cycle. This yields the existence of an ODC of Kp+1 by an almost‐hamiltonian cycle for primes p of order 3 mod 4 and its eventual existence for arbitrary primes p. © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 283–293, 2002; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10011 相似文献
7.
O. Fülöp 《Discrete Mathematics》2005,294(3):285-290
We give a short proof for the Mixed Connectivity Certificate Theorem of Even, Itkis and Rajsbaum and provide an upper bound on the edge number of a certificate of local T-mixed connectivity up to k. 相似文献
8.
9.
For an arbitrary bounded closed set E in the complex plane with complement Ω of finite connectivity, we study the degree of convergence of the lemniscates in Ω. 相似文献
10.