全文获取类型
收费全文 | 2928篇 |
免费 | 361篇 |
国内免费 | 330篇 |
专业分类
化学 | 718篇 |
晶体学 | 7篇 |
力学 | 154篇 |
综合类 | 66篇 |
数学 | 2131篇 |
物理学 | 543篇 |
出版年
2024年 | 9篇 |
2023年 | 31篇 |
2022年 | 81篇 |
2021年 | 78篇 |
2020年 | 84篇 |
2019年 | 78篇 |
2018年 | 99篇 |
2017年 | 104篇 |
2016年 | 90篇 |
2015年 | 81篇 |
2014年 | 142篇 |
2013年 | 226篇 |
2012年 | 151篇 |
2011年 | 177篇 |
2010年 | 150篇 |
2009年 | 207篇 |
2008年 | 232篇 |
2007年 | 207篇 |
2006年 | 215篇 |
2005年 | 149篇 |
2004年 | 141篇 |
2003年 | 125篇 |
2002年 | 115篇 |
2001年 | 89篇 |
2000年 | 96篇 |
1999年 | 87篇 |
1998年 | 69篇 |
1997年 | 54篇 |
1996年 | 58篇 |
1995年 | 35篇 |
1994年 | 32篇 |
1993年 | 20篇 |
1992年 | 11篇 |
1991年 | 11篇 |
1990年 | 6篇 |
1989年 | 6篇 |
1988年 | 4篇 |
1987年 | 2篇 |
1986年 | 10篇 |
1985年 | 4篇 |
1984年 | 8篇 |
1983年 | 7篇 |
1982年 | 7篇 |
1981年 | 8篇 |
1980年 | 7篇 |
1979年 | 7篇 |
1978年 | 4篇 |
1976年 | 2篇 |
1974年 | 1篇 |
1973年 | 1篇 |
排序方式: 共有3619条查询结果,搜索用时 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.
3.
《Discrete Mathematics》2020,343(12):112117
Let be an edge-colored graph of order . The minimum color degree of , denoted by , is the largest integer such that for every vertex , there are at least distinct colors on edges incident to . We say that an edge-colored graph is rainbow if all its edges have different colors. In this paper, we consider vertex-disjoint rainbow triangles in edge-colored graphs. Li (2013) showed that if , then contains a rainbow triangle and the lower bound is tight. Motivated by this result, we prove that if and , then contains two vertex-disjoint rainbow triangles. In particular, we conjecture that if , then contains vertex-disjoint rainbow triangles. For any integer , we show that if and , then contains vertex-disjoint rainbow triangles. Moreover, we provide sufficient conditions for the existence of edge-disjoint rainbow triangles. 相似文献
4.
Paul Bankston 《Archive for Mathematical Logic》2006,45(1):97-112
The Chang-Łoś-Suszko theorem of first-order model theory characterizes universal-existential classes of models as just those
elementary classes that are closed under unions of chains. This theorem can then be used to equate two model-theoretic closure
conditions for elementary classes; namely unions of chains and existential substructures. In the present paper we prove a
topological analogue and indicate some applications. 相似文献
5.
6.
图G称为K1,n-free图,如果它不含K1,n作为其导出子图.对K1,n-free图具有给定性质的[a,b]-因子涉及到最小度条件进行了研究,得到一个充分条件. 相似文献
7.
8.
Starch belongs to the polyglucan group. This type of polysaccharide shows a broad β-relaxation process in dielectric spectra at low temperatures, which has its molecular origin in orientational motions of sugar rings via glucosidic linkages. This chain dynamic was investigated for α(1,4)-linked starch oligomers with well-defined chain lengths of 2, 3, 4, 6, and 7 anhydroglucose units (AGUs) and for α(1,4)-polyglucans with average degrees of polymerization of 5, 10, 56, 70, and so forth (up to 3000; calculated from the mean molecular weight). The activation energy (Ea) of the segmental chain motion was lowest for dimeric maltose (Ea = 49.4 ± 1.3 kJ/mol), and this was followed by passage through a maximum at a degree of polymerization of 6 (Ea = 60.8 ± 1.8 kJ/mol). Subsequently, Ea leveled off at a value of about 52 ± 1.5 kJ/mol for chains containing more than 100 repeating units. The results were compared with the values of cellulose-like oligomers and polymers bearing a β(1,4)-linkage. Interestingly, the shape of the Ea dependency on the chain length of the molecules was qualitatively the same for both systems, whereas quantitatively the starch-like substances generally showed higher Ea values. Additionally, and for comparison, three cyclodextrins were measured by dielectric relaxation spectroscopy. The ringlike molecules, with 6, 7, and 8 α(1,4)-linked AGUs, showed moderately different types of dielectric spectra. © 2003 Wiley Periodicals, Inc. J Polym Sci Part B: Polym Phys 42: 188–197, 2004 相似文献
9.
本文研究一类具脉冲效应的时滞周期捕食与被捕食系统,利用重合度理论中的方法,获得该系统至少存在一个正周期解的充分条件。 相似文献
10.
For given a graph H, a graphic sequence π = (d
1, d
2,..., d
n) is said to be potentially H-graphic if there is a realization of π containing H as a subgraph. In this paper, we characterize the potentially (K
5 − e)-positive graphic sequences and give two simple necessary and sufficient conditions for a positive graphic sequence π to
be potentially K
5-graphic, where K
r is a complete graph on r vertices and K
r-e is a graph obtained from K
r by deleting one edge. Moreover, we also give a simple necessary and sufficient condition for a positive graphic sequence
π to be potentially K
6-graphic.
Project supported by National Natural Science Foundation of China (No. 10401010). 相似文献