全文获取类型
收费全文 | 5986篇 |
免费 | 423篇 |
国内免费 | 360篇 |
专业分类
化学 | 756篇 |
晶体学 | 4篇 |
力学 | 29篇 |
综合类 | 142篇 |
数学 | 5490篇 |
物理学 | 348篇 |
出版年
2024年 | 24篇 |
2023年 | 115篇 |
2022年 | 186篇 |
2021年 | 137篇 |
2020年 | 213篇 |
2019年 | 236篇 |
2018年 | 227篇 |
2017年 | 211篇 |
2016年 | 138篇 |
2015年 | 99篇 |
2014年 | 189篇 |
2013年 | 487篇 |
2012年 | 204篇 |
2011年 | 312篇 |
2010年 | 312篇 |
2009年 | 456篇 |
2008年 | 398篇 |
2007年 | 290篇 |
2006年 | 329篇 |
2005年 | 240篇 |
2004年 | 219篇 |
2003年 | 180篇 |
2002年 | 508篇 |
2001年 | 180篇 |
2000年 | 147篇 |
1999年 | 149篇 |
1998年 | 124篇 |
1997年 | 82篇 |
1996年 | 59篇 |
1995年 | 57篇 |
1994年 | 43篇 |
1993年 | 29篇 |
1992年 | 29篇 |
1991年 | 17篇 |
1990年 | 16篇 |
1989年 | 17篇 |
1988年 | 16篇 |
1987年 | 10篇 |
1986年 | 5篇 |
1985年 | 13篇 |
1984年 | 15篇 |
1983年 | 4篇 |
1982年 | 10篇 |
1981年 | 4篇 |
1980年 | 3篇 |
1977年 | 3篇 |
1975年 | 3篇 |
1974年 | 2篇 |
1971年 | 12篇 |
1970年 | 8篇 |
排序方式: 共有6769条查询结果,搜索用时 15 毫秒
101.
102.
Abstract The novel Cluj property indices are used for modeling the biological properties of dipeptides: the ACE inhibition activity of a set of 58 dipeptides and the bitter tasting activity of a set of 48 dipeptides, taken from the literature. The results are compared to those reported in some previous works. 相似文献
103.
104.
Let G be a 2k-edge-connected graph with and let for every . A spanning subgraph F of G is called an L-factor, if for every . In this article, we show that if for every , then G has a k-edge-connected L-factor. We also show that if and for every , then G has a k-edge-connected L-factor. 相似文献
105.
《Discrete Mathematics》2019,342(5):1361-1377
Highly regular graphs for which not all regularities are explainable by symmetries are fascinating creatures. Some of them like, e.g., the line graph of W. Kantor’s non-classical , are stumbling stones for existing implementations of graph isomorphism tests. They appear to be extremely rare and even once constructed it is difficult to prove their high regularity. Yet some of them, like the McLaughlin graph on 275 vertices and Ivanov’s graph on 256 vertices are of profound beauty. This alone makes it an attractive goal to strive for their complete classification or, failing this, at least to get a deep understanding of them. Recently, one of the authors discovered new methods for proving high regularity of graphs. Using these techniques, in this paper we study a classical family of strongly regular graphs, originally discovered by A.E. Brouwer, A.V. Ivanov, and M.H. Klin in the late 80s. We analyse their symmetries and show that they are -regular but not 2-homogeneous. Thus we promote these graphs to the distinguished club of highly regular graphs with few symmetries. 相似文献
106.
107.
We show that an arbitrary infinite graph G can be compactified by its ends plus its critical vertex sets, where a finite set X of vertices of an infinite graph is critical if its deletion leaves some infinitely many components each with neighbourhood precisely equal to X. We further provide a concrete separation system whose ?0‐tangles are precisely the ends plus critical vertex sets. Our tangle compactification is a quotient of Diestel's (denoted by ), and both use tangles to compactify a graph in much the same way as the ends of a locally finite and connected graph compactify it in its Freudenthal compactification. Finally, generalising both Diestel's construction of and our construction of , we show that G can be compactified by every inverse limit of compactifications of the sets of components obtained by deleting a finite set of vertices. Diestel's is the finest such compactification, and our is the coarsest one. Both coincide if and only if all tangles are ends. This answers two questions of Diestel. 相似文献
108.
Douglas R. Woodall 《Journal of Graph Theory》2019,92(4):488-490
In the article “The average degree of an edge-chromatic critical graph II” by Douglas R. Woodall (J. Graph Theory 56 (2007), 194-218), it was claimed that the average degree of an edge-chromatic critical graph with maximum degree is at least if , at least if , and at least if . Unfortunately there were mistakes in the proof of the last two of these results, which are now proved only if and , respectively. 相似文献
109.
Marién Abreu Jan Goedgebeur Domenico Labbate Giuseppe Mazzuoccolo 《Journal of Graph Theory》2019,92(4):415-444
A -bisection of a bridgeless cubic graph is a -colouring of its vertex set such that the colour classes have the same cardinality and all connected components in the two subgraphs induced by the colour classes ( monochromatic components in what follows) have order at most . Ban and Linial Conjectured that every bridgeless cubic graph admits a -bisection except for the Petersen graph. A similar problem for the edge set of cubic graphs has been studied: Wormald conjectured that every cubic graph with has a -edge colouring such that the two monochromatic subgraphs are isomorphic linear forests (ie, a forest whose components are paths). Finally, Ando conjectured that every cubic graph admits a bisection such that the two induced monochromatic subgraphs are isomorphic. In this paper, we provide evidence of a strong relation of the conjectures of Ban-Linial and Wormald with Ando's Conjecture. Furthermore, we also give computational and theoretical evidence in their support. As a result, we pose some open problems stronger than the above-mentioned conjectures. Moreover, we prove Ban-Linial's Conjecture for cubic-cycle permutation graphs. As a by-product of studying -edge colourings of cubic graphs having linear forests as monochromatic components, we also give a negative answer to a problem posed by Jackson and Wormald about certain decompositions of cubic graphs into linear forests. 相似文献
110.
Let m ≤ n ≤ k. An m × n × k 0‐1 array is a Latin box if it contains exactly m n ones, and has at most one 1 in each line. As a special case, Latin boxes in which m = n = k are equivalent to Latin squares. Let be the distribution on m × n × k 0‐1 arrays where each entry is 1 with probability p, independently of the other entries. The threshold question for Latin squares asks when contains a Latin square with high probability. More generally, when does support a Latin box with high probability? Let ε > 0. We give an asymptotically tight answer to this question in the special cases where n = k and , and where n = m and . In both cases, the threshold probability is . This implies threshold results for Latin rectangles and proper edge‐colorings of Kn,n. 相似文献