全文获取类型
收费全文 | 1714篇 |
免费 | 122篇 |
国内免费 | 203篇 |
专业分类
化学 | 185篇 |
晶体学 | 1篇 |
力学 | 31篇 |
综合类 | 36篇 |
数学 | 773篇 |
物理学 | 205篇 |
综合类 | 808篇 |
出版年
2024年 | 10篇 |
2023年 | 15篇 |
2022年 | 28篇 |
2021年 | 38篇 |
2020年 | 44篇 |
2019年 | 40篇 |
2018年 | 40篇 |
2017年 | 43篇 |
2016年 | 46篇 |
2015年 | 48篇 |
2014年 | 68篇 |
2013年 | 109篇 |
2012年 | 107篇 |
2011年 | 111篇 |
2010年 | 118篇 |
2009年 | 111篇 |
2008年 | 122篇 |
2007年 | 113篇 |
2006年 | 109篇 |
2005年 | 93篇 |
2004年 | 87篇 |
2003年 | 82篇 |
2002年 | 69篇 |
2001年 | 60篇 |
2000年 | 46篇 |
1999年 | 48篇 |
1998年 | 43篇 |
1997年 | 32篇 |
1996年 | 24篇 |
1995年 | 25篇 |
1994年 | 10篇 |
1993年 | 14篇 |
1992年 | 17篇 |
1991年 | 13篇 |
1990年 | 14篇 |
1989年 | 10篇 |
1988年 | 7篇 |
1987年 | 4篇 |
1986年 | 6篇 |
1985年 | 2篇 |
1984年 | 2篇 |
1983年 | 1篇 |
1982年 | 3篇 |
1980年 | 2篇 |
1978年 | 1篇 |
1976年 | 4篇 |
排序方式: 共有2039条查询结果,搜索用时 203 毫秒
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.
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. 相似文献
3.
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 Ω. 相似文献
4.
We deal with MAXH0-FREE PARTIAL SUBGRAPH. We mainly prove that 3-locally optimum solutions achieve approximation ratio (δ0+1)/(B+2+ν0), where B=maxv∈VdG(v), δ0=minv∈V(H0)dH0(v) and ν0=(|V(H0)|+1)/δ0. Next, we show that this ratio rises up to 3/(B+1) when H0=K3. Finally, we provide hardness results for MAXK3-FREE PARTIAL SUBGRAPH. 相似文献
5.
The paper discusses the relationship between weights and control vertices of two rational NURBS curves of degree two or three with all weights larger than zero when they represent the same curve parametrically and geometrically, and gives sufficient and necessary conditions for coincidence of two rational NURBS curves in non-degeneracy case. 相似文献
6.
The application of some recently proposed algebraic multilevel methods for the solution of two-dimensional finite element problems on nonuniform meshes is studied. The locally refined meshes are created by the newest vertex mesh refinement method. After the introduction of this refinement technique it is shown that, by combining levels of refinement, a preconditioner of optimal order can be constructed for the case of local refinement along a line. Its relative condition number is accurately estimated. Numerical tests demonstrating the performance of the proposed preconditioners will be reported in a forthcoming paper. 相似文献
7.
廖业元 《北京交通大学学报(自然科学版)》1992,(1)
在用“奇偶点图上作业法”求解“中国邮路问题”时,需检查图中的每一个回路.当图中回路较多时,检查不便且易出错.针对此,本文建立了求解“中国邮路问题”的0-1规划模型,并给出了算例。 相似文献
8.
图G(V,E)的一个k-正常全染色f叫做一个k-点强全染色当且仅当对任意v∈V(G), N[v]中的元素被染不同色,其中N[v]={u|uv∈V(G)}∪{v}.χTvs(G)=min{k|存在图G的k- 点强全染色}叫做图G的点强全色数.对3-连通平面图G(V,E),如果删去面fo边界上的所有点后的图为一个树图,则G(V,E)叫做一个Halin-图.本文确定了最大度不小于6的Halin- 图和一些特殊图的的点强全色数XTvs(G),并提出了如下猜想:设G(V,E)为每一连通分支的阶不小于6的图,则χTvs(G)≤△(G) 2,其中△(G)为图G(V,E)的最大度. 相似文献
9.
Let P(G,λ) be the chromatic polynomial of a graph G with n vertices, independence number α and clique number ω. We show that for every λ≥n, ()α≤≤ ()
n
−ω. We characterize the graphs that yield the lower bound or the upper bound.?These results give new bounds on the mean colour
number μ(G) of G: n− (n−ω)()
n
−ω≤μ(G)≤n−α() α.
Received: December 12, 2000 / Accepted: October 18, 2001?Published online February 14, 2002 相似文献
10.
Let G=(V,E) be a undirected k-edge connected graph with weights ce on edges and wv on nodes. The minimum 2-edge connected subgraph problem, 2ECSP for short, is to find a 2-edge connected subgraph of G, of minimum total weight. The 2ECSP generalizes the well-known Steiner 2-edge connected subgraph problem. In this paper we study the convex hull of the incidence vectors corresponding to feasible solutions of 2ECSP. First, a natural integer programming formulation is given and it is shown that its linear relaxation is not sufficient to describe the polytope associated with 2ECSP even when G is series-parallel. Then, we introduce two families of new valid inequalities and we give sufficient conditions for them to be facet-defining. Later, we concentrate on the separation problem. We find polynomial time algorithms to solve the separation of important subclasses of the introduced inequalities, concluding that the separation of the new inequalities, when G is series-parallel, is polynomially solvable. 相似文献