全文获取类型
收费全文 | 7411篇 |
免费 | 741篇 |
国内免费 | 502篇 |
专业分类
化学 | 734篇 |
晶体学 | 11篇 |
力学 | 310篇 |
综合类 | 189篇 |
数学 | 6295篇 |
物理学 | 1115篇 |
出版年
2024年 | 15篇 |
2023年 | 126篇 |
2022年 | 177篇 |
2021年 | 191篇 |
2020年 | 252篇 |
2019年 | 291篇 |
2018年 | 276篇 |
2017年 | 292篇 |
2016年 | 224篇 |
2015年 | 163篇 |
2014年 | 295篇 |
2013年 | 607篇 |
2012年 | 353篇 |
2011年 | 417篇 |
2010年 | 395篇 |
2009年 | 589篇 |
2008年 | 541篇 |
2007年 | 412篇 |
2006年 | 456篇 |
2005年 | 323篇 |
2004年 | 294篇 |
2003年 | 270篇 |
2002年 | 253篇 |
2001年 | 233篇 |
2000年 | 199篇 |
1999年 | 182篇 |
1998年 | 161篇 |
1997年 | 123篇 |
1996年 | 73篇 |
1995年 | 82篇 |
1994年 | 71篇 |
1993年 | 50篇 |
1992年 | 43篇 |
1991年 | 28篇 |
1990年 | 23篇 |
1989年 | 25篇 |
1988年 | 26篇 |
1987年 | 19篇 |
1986年 | 11篇 |
1985年 | 20篇 |
1984年 | 17篇 |
1983年 | 5篇 |
1982年 | 15篇 |
1981年 | 4篇 |
1980年 | 7篇 |
1979年 | 3篇 |
1977年 | 7篇 |
1976年 | 3篇 |
1975年 | 5篇 |
1974年 | 3篇 |
排序方式: 共有8654条查询结果,搜索用时 31 毫秒
991.
992.
Isidoro Gitler 《Discrete Mathematics》2010,310(3):430-441
We study the family of graphs whose number of primitive cycles equals its cycle rank. It is shown that this family is precisely the family of ring graphs. Then we study the complete intersection property of toric ideals of bipartite graphs and oriented graphs. An interesting application is that complete intersection toric ideals of bipartite graphs correspond to ring graphs and that these ideals are minimally generated by Gröbner bases. We prove that any graph can be oriented such that its toric ideal is a complete intersection with a universal Gröbner basis determined by the cycles. It turns out that bipartite ring graphs are exactly the bipartite graphs that have complete intersection toric ideals for any orientation. 相似文献
993.
Mitre C. Dourado 《Discrete Mathematics》2010,310(4):832-1977
A set of vertices D of a graph G is geodetic if every vertex of G lies on a shortest path between two not necessarily distinct vertices in D. The geodetic number of G is the minimum cardinality of a geodetic set of G.We prove that it is NP-complete to decide for a given chordal or chordal bipartite graph G and a given integer k whether G has a geodetic set of cardinality at most k. Furthermore, we prove an upper bound on the geodetic number of graphs without short cycles and study the geodetic number of cographs, split graphs, and unit interval graphs. 相似文献
994.
Rudi Penne 《Discrete Mathematics》2010,310(4):966-969
We consider words over a finite alphabet with certain uniqueness properties (a subsequence of length k does not occur more than once) and distance properties (at least j other symbols separate the occurrence of the same symbol). The maximal length of these words is realised by linear de Bruijn sequences with certain forbidden subsequences. We prove the existence of these maximal sequences. 相似文献
995.
Roland Kaschek 《Discrete Mathematics》2010,310(8):1275-1281
This paper proves a necessary and sufficient condition for the endomorphism monoid of a lexicographic product G[H] of graphs G,H to be the wreath product of the monoids and . The paper also gives respective necessary and sufficient conditions for specialized cases such as for unretractive or triangle-free graphs G. 相似文献
996.
Vsevolod F. Lev 《Discrete Mathematics》2010,310(3):575-584
Given a finite abelian group G, consider the complete graph on the set of all elements of G. Find a Hamiltonian cycle in this graph and for each pair of consecutive vertices along the cycle compute their sum. What are the smallest and the largest possible number of distinct sums that can emerge in this way? What is the expected number of distinct sums if the cycle is chosen randomly? How do the answers change if an orientation is given to the cycle and differences (instead of sums) are computed? We give complete solutions to some of these problems and establish reasonably sharp estimates for the rest. 相似文献
997.
Yusuke Suzuki 《Discrete Mathematics》2010,310(1):6-11
We show that, for any given non-spherical orientable closed surface F2, there exists an optimal 1-planar graph which can be embedded on F2 as a triangulation. On the other hand, we prove that there does not exist any such graph for the nonorientable closed surfaces of genus at most 3. 相似文献
998.
The spectral excess theorem provides a quasi-spectral characterization for a (regular) graph Γ with d+1 distinct eigenvalues to be distance-regular graph, in terms of the excess (number of vertices at distance d) of each of its vertices. The original approach, due to Fiol and Garriga in 1997, was obtained by using a local approach, so giving a characterization of the so-called pseudo-distance-regularity around a vertex. In this paper we present a new simple projection method based in a global point of view, and where the mean excess plays an essential role. 相似文献
999.
Jacobson, Levin, and Scheinerman introduced the fractional Ramsey function rf (a1, a2, …, ak) as an extension of the classical definition for Ramsey numbers. They determined an exact formula for the fractional Ramsey function for the case k=2. In this article, we answer an open problem by determining an explicit formula for the general case k>2 by constructing an infinite family of circulant graphs for which the independence numbers can be computed explicitly. This construction gives us two further results: a new (infinite) family of star extremal graphs which are a superset of many of the families currently known in the literature, and a broad generalization of known results on the chromatic number of integer distance graphs. © 2009 Wiley Periodicals, Inc. J Graph Theory 63: 164–178, 2010 相似文献
1000.