全文获取类型
收费全文 | 6233篇 |
免费 | 208篇 |
国内免费 | 99篇 |
专业分类
化学 | 3151篇 |
晶体学 | 23篇 |
力学 | 50篇 |
综合类 | 39篇 |
数学 | 2716篇 |
物理学 | 561篇 |
出版年
2024年 | 12篇 |
2023年 | 48篇 |
2022年 | 69篇 |
2021年 | 61篇 |
2020年 | 242篇 |
2019年 | 417篇 |
2018年 | 163篇 |
2017年 | 372篇 |
2016年 | 142篇 |
2015年 | 156篇 |
2014年 | 186篇 |
2013年 | 301篇 |
2012年 | 217篇 |
2011年 | 302篇 |
2010年 | 212篇 |
2009年 | 352篇 |
2008年 | 375篇 |
2007年 | 331篇 |
2006年 | 320篇 |
2005年 | 242篇 |
2004年 | 254篇 |
2003年 | 248篇 |
2002年 | 214篇 |
2001年 | 196篇 |
2000年 | 148篇 |
1999年 | 140篇 |
1998年 | 109篇 |
1997年 | 123篇 |
1996年 | 89篇 |
1995年 | 50篇 |
1994年 | 47篇 |
1993年 | 44篇 |
1992年 | 32篇 |
1991年 | 30篇 |
1990年 | 23篇 |
1989年 | 21篇 |
1988年 | 15篇 |
1987年 | 11篇 |
1986年 | 15篇 |
1985年 | 29篇 |
1984年 | 26篇 |
1983年 | 11篇 |
1982年 | 12篇 |
1981年 | 22篇 |
1980年 | 18篇 |
1979年 | 20篇 |
1978年 | 23篇 |
1977年 | 18篇 |
1976年 | 9篇 |
1973年 | 8篇 |
排序方式: 共有6540条查询结果,搜索用时 15 毫秒
61.
记Ore2=min{d(y) d(x)|x,y∈V(G),d(x,y)=2},本得到:若n阶图G的Ore2≥n 1,则G是[5;n]泛连通图。此是比Faudree等人的定理进一步的结果。 相似文献
62.
63.
64.
Chepoi showed that every breadth first search of a bridged graph produces a cop-win ordering of the graph. We note here that Chepoi's proof gives a simple proof of the theorem that G is bridged if and only if G is cop-win and has no induced cycle of length four or five, and that this characterization together with Chepoi's proof reduces the time complexity of bridged graph recognition. Specifically, we show that bridged graph recognition is equivalent to (C4,C5)-free graph recognition, and reduce the best known time complexity from O(n4) to O(n3.376). 相似文献
65.
66.
A (p, q)-sigraph S is an ordered pair (G, s) where G = (V, E) is a (p, q)-graph and s is a function which assigns to each edge of G a positive or a negative sign. Let the sets E
+ and E
– consist of m positive and n negative edges of G, respectively, where m + n = q. Given positive integers k and d, S is said to be (k, d)-graceful if the vertices of G can be labeled with distinct integers from the set {0, 1, ..., k + (q – 1)d such that when each edge uv of G is assigned the product of its sign and the absolute difference of the integers assigned to u and v the edges in E
+ and E
– are labeled k, k + d, k + 2d, ..., k + (m – 1)d and –k, – (k + d), – (k + 2d), ..., – (k + (n – 1)d), respectively.In this paper, we report results of our preliminary investigation on the above new notion, which indeed generalises the well-known concept of (k, d)-graceful graphs due to B. D. Acharya and S. M. Hegde. 相似文献
67.
Let G = (V,E) be a graph or digraph and r : V → Z+. An r‐detachment of G is a graph H obtained by ‘splitting’ each vertex ν ∈ V into r(ν) vertices. The vertices ν1,…,νr(ν) obtained by splitting ν are called the pieces of ν in H. Every edge uν ∈ E corresponds to an edge of H connecting some piece of u to some piece of ν. Crispin Nash‐Williams 9 gave necessary and sufficient conditions for a graph to have a k‐edge‐connected r‐detachment. He also solved the version where the degrees of all the pieces are specified. In this paper, we solve the same problems for directed graphs. We also give a simple and self‐contained new proof for the undirected result. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 67–77, 2003 相似文献
68.
For each infinite cardinal κ, we give examples of 2κ many non‐isomorphic vertex‐transitive graphs of order κ that are pairwise isomorphic to induced subgraphs of each other. We consider examples of graphs with these properties that are also universal, in the sense that they embed all graphs with smaller orders as induced subgraphs. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 99–106, 2003 相似文献
69.
A novel liquid scintillator system using metal β-diketonate chemistry based on loadings of indium, a target of current interest in low energy solar neutrino detection, is developed. The optical absorption, fluorescence and scintillation properties for this new system are described. The scintillation light output as found from the irradiation by low energy gamma-rays is presented. Notable light yields are found. 相似文献
70.
Jochen Alber Jií Fiala 《Journal of Algorithms in Cognition, Informatics and Logic》2004,52(2):134-151
We consider the parameterized problem, whether for a given set
of n disks (of bounded radius ratio) in the Euclidean plane there exists a set of k non-intersecting disks. For this problem, we expose an algorithm running in time
that is—to our knowledge—the first algorithm with running time bounded by an exponential with a sublinear exponent. For λ-precision disk graphs of bounded radius ratio, we show that the problem is fixed parameter tractable with a running time
. The results are based on problem kernelization and a new “geometric (
-separator) theorem” which holds for all disk graphs of bounded radius ratio. The presented algorithm then performs, in a first step, a “geometric problem kernelization” and, in a second step, uses divide-and-conquer based on our new “geometric separator theorem.” 相似文献