全文获取类型
收费全文 | 10080篇 |
免费 | 692篇 |
国内免费 | 799篇 |
专业分类
化学 | 1013篇 |
晶体学 | 6篇 |
力学 | 34篇 |
综合类 | 150篇 |
数学 | 5472篇 |
物理学 | 405篇 |
综合类 | 4491篇 |
出版年
2024年 | 45篇 |
2023年 | 150篇 |
2022年 | 237篇 |
2021年 | 204篇 |
2020年 | 278篇 |
2019年 | 280篇 |
2018年 | 269篇 |
2017年 | 265篇 |
2016年 | 193篇 |
2015年 | 218篇 |
2014年 | 370篇 |
2013年 | 611篇 |
2012年 | 437篇 |
2011年 | 543篇 |
2010年 | 493篇 |
2009年 | 658篇 |
2008年 | 592篇 |
2007年 | 579篇 |
2006年 | 639篇 |
2005年 | 489篇 |
2004年 | 415篇 |
2003年 | 376篇 |
2002年 | 652篇 |
2001年 | 332篇 |
2000年 | 291篇 |
1999年 | 287篇 |
1998年 | 254篇 |
1997年 | 188篇 |
1996年 | 158篇 |
1995年 | 142篇 |
1994年 | 126篇 |
1993年 | 111篇 |
1992年 | 111篇 |
1991年 | 91篇 |
1990年 | 75篇 |
1989年 | 83篇 |
1988年 | 60篇 |
1987年 | 47篇 |
1986年 | 21篇 |
1985年 | 24篇 |
1984年 | 20篇 |
1982年 | 19篇 |
1980年 | 11篇 |
1977年 | 20篇 |
1976年 | 15篇 |
1975年 | 13篇 |
1974年 | 13篇 |
1973年 | 19篇 |
1971年 | 12篇 |
1970年 | 8篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
11.
1989年发表的Bager第五图,包含关于三角形元素的35个二次规范画数之间的51个不等式通过细致的分析,本文给出了其中遗漏的12个基本不等式 相似文献
12.
侯旻 《新疆大学学报(理工版)》1991,(1)
本文比较了循环图类{c_p(n_1,…,n_p)}和{c-p(n_1…,n_p,p/α)}的直径下界。对于p和α满足一定条件的循环图类{c_p(n_1,n_2,p/α)},本文给出了达到或几乎达到此图类直径下界的一类几乎最优循环图{c_p(m,m+1,p/α)}。 相似文献
13.
对δ(G)≥8的连续三次图G是边可重构的定理给出了一个简单证明。此外还证明了,当δ(G)=7,γ(G)≤82以及δ(G)=6,γ(G)≤17时,连续三次图G是边可重构的 相似文献
14.
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 相似文献
15.
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. 相似文献
16.
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 相似文献
17.
用Moore-Smith收敛给出了一个拓扑空间分别是T0,T1,正则,正规空间的充要条件. 相似文献
18.
Let G = (V,E) be a graph or digraph and r : V → Z+. An r‐detachment of G is a graph H obtained by ‘splitting’ each vertex ν ∈ V into r(ν) vertices. The vertices ν1,…,νr(ν) obtained by splitting ν are called the pieces of ν in H. Every edge uν ∈ E corresponds to an edge of H connecting some piece of u to some piece of ν. Crispin Nash‐Williams 9 gave necessary and sufficient conditions for a graph to have a k‐edge‐connected r‐detachment. He also solved the version where the degrees of all the pieces are specified. In this paper, we solve the same problems for directed graphs. We also give a simple and self‐contained new proof for the undirected result. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 67–77, 2003 相似文献
19.
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 相似文献
20.
Ioan Tomescu 《Journal of Graph Theory》2003,43(3):210-222
In the set of graphs of order n and chromatic number k the following partial order relation is defined. One says that a graph G is less than a graph H if ci(G) ≤ ci(H) holds for every i, k ≤ i ≤ n and at least one inequality is strict, where ci(G) denotes the number of i‐color partitions of G. In this paper the first ? n/2 ? levels of the diagram of the partially ordered set of connected 3‐chromatic graphs of order n are described. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 210–222, 2003 相似文献