全文获取类型
收费全文 | 10761篇 |
免费 | 765篇 |
国内免费 | 1003篇 |
专业分类
化学 | 334篇 |
晶体学 | 4篇 |
力学 | 78篇 |
综合类 | 183篇 |
数学 | 6175篇 |
物理学 | 532篇 |
综合类 | 5223篇 |
出版年
2024年 | 44篇 |
2023年 | 154篇 |
2022年 | 250篇 |
2021年 | 210篇 |
2020年 | 276篇 |
2019年 | 298篇 |
2018年 | 281篇 |
2017年 | 290篇 |
2016年 | 191篇 |
2015年 | 225篇 |
2014年 | 418篇 |
2013年 | 665篇 |
2012年 | 501篇 |
2011年 | 611篇 |
2010年 | 539篇 |
2009年 | 728篇 |
2008年 | 676篇 |
2007年 | 700篇 |
2006年 | 709篇 |
2005年 | 572篇 |
2004年 | 499篇 |
2003年 | 437篇 |
2002年 | 394篇 |
2001年 | 362篇 |
2000年 | 332篇 |
1999年 | 345篇 |
1998年 | 300篇 |
1997年 | 234篇 |
1996年 | 192篇 |
1995年 | 173篇 |
1994年 | 137篇 |
1993年 | 133篇 |
1992年 | 127篇 |
1991年 | 103篇 |
1990年 | 94篇 |
1989年 | 93篇 |
1988年 | 69篇 |
1987年 | 53篇 |
1986年 | 24篇 |
1985年 | 23篇 |
1984年 | 19篇 |
1983年 | 5篇 |
1982年 | 13篇 |
1981年 | 5篇 |
1980年 | 6篇 |
1979年 | 2篇 |
1978年 | 2篇 |
1977年 | 3篇 |
1975年 | 3篇 |
1974年 | 3篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
61.
Let D be a digraph. The competition-common enemy graph (CCE graph) of D has the same set of vertices as D and an edge between vertices u and v if and only if there are vertices w and x in D such that (w,u), (w,v), (u,x), and (v,x) are arcs of D. We call a graph a CCE graph if it is the CCE graph of some digraph. In this paper, we show that if the CCE graph of a doubly partial order does not contain C4 as an induced subgraph, it is an interval graph. We also show that any interval graph together with enough isolated vertices is the CCE graph of some doubly partial order. 相似文献
62.
Z. G. Khisamiev 《Algebra and Logic》2007,46(1):50-61
We study into a semilattice of numberings generated by a given fixed numbering via operations of completion and taking least
upper bounds. It is proved that, except for the trivial cases, this semilattice is an infinite distributive lattice every
principal ideal in which is finite. The least upper and the greatest lower bounds in the semilattice are invariant under extensions
in the semilattice of all numberings. Isomorphism types for the semilattices in question are in one-to-one correspondence
with pairs of cardinals the first component of which is equal to the cardinality of a set of non-special elements, and the
second — to the cardinality of a set of special elements, of the initial numbering.
Supported by INTAS grant No. 00-429.
__________
Translated from Algebra i Logika, Vol. 46, No. 1, pp. 83–102, January–February, 2007. 相似文献
63.
We prove that if T is a tournament of order n > 6 in which any 4-sub-tournament is hamiltonian or transitive, then T is reconstructible in the sense of Ulam. 相似文献
64.
Lingsheng Shi 《Journal of Graph Theory》2005,50(3):175-185
The Ramsey number R(G1,G2) of two graphs G1 and G2 is the least integer p so that either a graph G of order p contains a copy of G1 or its complement Gc contains a copy of G2. In 1973, Burr and Erd?s offered a total of $25 for settling the conjecture that there is a constant c = c(d) so that R(G,G)≤ c|V(G)| for all d‐degenerate graphs G, i.e., the Ramsey numbers grow linearly for d‐degenerate graphs. We show in this paper that the Ramsey numbers grow linearly for degenerate graphs versus some sparser graphs, arrangeable graphs, and crowns for example. This implies that the Ramsey numbers grow linearly for degenerate graphs versus graphs with bounded maximum degree, planar graphs, or graphs without containing any topological minor of a fixed clique, etc. © 2005 Wiley Periodicals, Inc. J Graph Theory 相似文献
65.
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 相似文献
66.
67.
面对多样化的市场需求,企业的销售渠道也变得异常复杂,利用网络图可以简化实际问题,并能形象地描述它。本根据网络知识建立了产品分销模型,探求企业在市场需求固定和随机时的最优收益。最后,章还进行实例验算,并做出相应的结果分析。 相似文献
68.
69.
Periodica Mathematica Hungarica - Let X 1,X 2,... be a sequence of independent and identically distributed random variables, and put % MATHTYPE!MTEF!2!1!+-%... 相似文献
70.