全文获取类型
收费全文 | 10407篇 |
免费 | 674篇 |
国内免费 | 861篇 |
专业分类
化学 | 299篇 |
晶体学 | 4篇 |
力学 | 99篇 |
综合类 | 155篇 |
数学 | 5869篇 |
物理学 | 480篇 |
综合类 | 5036篇 |
出版年
2024年 | 33篇 |
2023年 | 143篇 |
2022年 | 229篇 |
2021年 | 201篇 |
2020年 | 274篇 |
2019年 | 291篇 |
2018年 | 280篇 |
2017年 | 269篇 |
2016年 | 173篇 |
2015年 | 204篇 |
2014年 | 372篇 |
2013年 | 676篇 |
2012年 | 455篇 |
2011年 | 570篇 |
2010年 | 513篇 |
2009年 | 690篇 |
2008年 | 660篇 |
2007年 | 661篇 |
2006年 | 676篇 |
2005年 | 561篇 |
2004年 | 456篇 |
2003年 | 421篇 |
2002年 | 390篇 |
2001年 | 351篇 |
2000年 | 337篇 |
1999年 | 313篇 |
1998年 | 288篇 |
1997年 | 212篇 |
1996年 | 176篇 |
1995年 | 170篇 |
1994年 | 137篇 |
1993年 | 124篇 |
1992年 | 124篇 |
1991年 | 101篇 |
1990年 | 82篇 |
1989年 | 94篇 |
1988年 | 72篇 |
1987年 | 48篇 |
1986年 | 23篇 |
1985年 | 25篇 |
1984年 | 16篇 |
1983年 | 6篇 |
1982年 | 16篇 |
1981年 | 7篇 |
1980年 | 6篇 |
1978年 | 3篇 |
1977年 | 3篇 |
1976年 | 2篇 |
1975年 | 3篇 |
1974年 | 2篇 |
排序方式: 共有10000条查询结果,搜索用时 297 毫秒
91.
92.
Valuations of dense near polygons were introduced in 16 . In the present paper, we classify all valuations of the near hexagons ??1 and ??2, which are related to the respective Witt designs S(5,6,12) and S(5,8,24). Using these classifications, we prove that if a dense near polygon S contains a hex H isomorphic to ??1 or ??2, then H is classical in S. We will use this result to determine all dense near octagons that contain a hex isomorphic to ??1 or ??2. As a by‐product, we obtain a purely geometrical proof for the nonexistence of regular near 2d‐gons, d ≥ 4, whose parameters s, t, ti (0 ≤ i ≤ d) satisfy (s, t2, t3) = (2, 1, 11) or (2, 2, 14). The nonexistence of these regular near polygons can also be shown with the aid of eigenvalue techniques. © 2005 Wiley Periodicals, Inc. J Combin Designs 14: 214–228, 2006 相似文献
93.
给出了半无爪图(quasi-claw-freegraph)点泛圈性方面的两个结果,作为推论,可得到D.Oberly,D.Sumner,L.Clark等人的相关结果. 相似文献
94.
Thomas Andreae 《Journal of Graph Theory》2002,39(4):222-229
For a graph A and a positive integer n, let nA denote the union of n disjoint copies of A; similarly, the union of ?0 disjoint copies of A is referred to as ?0A. It is shown that there exist (connected) graphs A and G such that nA is a minor of G for all n??, but ?0A is not a minor of G. This supplements previous examples showing that analogous statements are true if, instead of minors, isomorphic embeddings or topological minors are considered. The construction of A and G is based on the fact that there exist (infinite) graphs G1, G2,… such that Gi is not a minor of Gj for all i ≠ j. In contrast to previous examples concerning isomorphic embeddings and topological minors, the graphs A and G presented here are not locally finite. The following conjecture is suggested: for each locally finite connected graph A and each graph G, if nA is a minor of G for all n ? ?, then ?0A is a minor of G, too. If true, this would be a far‐reaching generalization of a classical result of R. Halin on families of disjoint one‐way infinite paths in graphs. © 2002 Wiley Periodicals, Inc. J Graph Theory 39: 222–229, 2002; DOI 10.1002/jgt.10016 相似文献
95.
Vizing(1964年)和Gupta(1966年)各自独立地证明了边着色中的重要定理:对任何简单图G,表X′(G)=△或X′(G)△+1。但确定一个图G的边色数仍是一个尚未解决的问题。本文利用系列平行图的结构性质,确定了它的边色数。 相似文献
96.
若干图的Mycielskian图的边色数 总被引:3,自引:0,他引:3
对图G(V,E),μ(G)称为G的Mycielskian图,若V(μ(G))=V(G)∪{v′|v∈V(G)}∪{w}且w V(G),而E(μ(G))=E(G)∪{uv′|uv∈E(G)}∪{wv′}.研究了路、圈、扇、轮图的Mycielskian图的边色数. 相似文献
97.
We present a Bayesian theory of object identification. Here, identifying an object means selecting a particular observation from a group of observations (variants), this observation (the regular variant) being characterized by a distributional model. In this sense, object identification means assigning a given model to one of several observations. Often, it is the statistical model of the regular variant, only, that is known. We study an estimator which relies essentially on this model and not on the characteristics of the “irregular” variants. In particular, we investigate under what conditions this variant selector is optimal. It turns out that there is a close relationship with exchangeability and Markovian reversibility. We finally apply our theory to the case of irregular variants generated from the regular variant by a Gaussian linear model. 相似文献
98.
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. 相似文献
99.
100.
结合边连通度,本文探讨了3-边连通简单网的独立数与上可嵌人性的关系,我们得到了下列结果:设G是一个3-边连通简单图,α(G)是G的独立数,若α/(G)≤5,则G是上可嵌入的,同时我们又得到了两个在3-边连通意义下最小的非上可嵌入图例. 相似文献