全文获取类型
收费全文 | 6574篇 |
免费 | 483篇 |
国内免费 | 682篇 |
专业分类
化学 | 783篇 |
晶体学 | 16篇 |
力学 | 756篇 |
综合类 | 96篇 |
数学 | 4868篇 |
物理学 | 1220篇 |
出版年
2024年 | 15篇 |
2023年 | 78篇 |
2022年 | 167篇 |
2021年 | 144篇 |
2020年 | 206篇 |
2019年 | 196篇 |
2018年 | 177篇 |
2017年 | 207篇 |
2016年 | 196篇 |
2015年 | 144篇 |
2014年 | 251篇 |
2013年 | 516篇 |
2012年 | 293篇 |
2011年 | 377篇 |
2010年 | 327篇 |
2009年 | 493篇 |
2008年 | 480篇 |
2007年 | 437篇 |
2006年 | 393篇 |
2005年 | 366篇 |
2004年 | 273篇 |
2003年 | 264篇 |
2002年 | 243篇 |
2001年 | 190篇 |
2000年 | 190篇 |
1999年 | 180篇 |
1998年 | 203篇 |
1997年 | 148篇 |
1996年 | 114篇 |
1995年 | 55篇 |
1994年 | 57篇 |
1993年 | 47篇 |
1992年 | 47篇 |
1991年 | 39篇 |
1990年 | 24篇 |
1989年 | 21篇 |
1988年 | 22篇 |
1987年 | 23篇 |
1986年 | 18篇 |
1985年 | 13篇 |
1984年 | 24篇 |
1983年 | 5篇 |
1982年 | 15篇 |
1981年 | 11篇 |
1980年 | 9篇 |
1979年 | 12篇 |
1978年 | 11篇 |
1975年 | 2篇 |
1974年 | 4篇 |
1972年 | 3篇 |
排序方式: 共有7739条查询结果,搜索用时 14 毫秒
1.
2.
Christian Bosse 《Discrete Mathematics》2019,342(12):111595
The Hadwiger number of a graph , denoted , is the largest integer such that contains as a minor. A famous conjecture due to Hadwiger in 1943 states that for every graph , , where denotes the chromatic number of . Let denote the independence number of . A graph is -free if it does not contain the graph as an induced subgraph. In 2003, Plummer, Stiebitz and Toft proved that for all -free graphs with , where is any graph on four vertices with , , or is a particular graph on seven vertices. In 2010, Kriesell subsequently generalized the statement to include all forbidden subgraphs on five vertices with . In this note, we prove that for all -free graphs with , where denotes the wheel on six vertices. 相似文献
3.
Let ir(G) and γ(G) be the irredundance number and the domination number of a graph G, respectively. A graph G is called irredundance perfect if ir(H)=γ(H), for every induced subgraph H of G. In this article we present a result which immediately implies three known conjectures on irredundance perfect graphs. © 2002 Wiley Periodicals, Inc. J Graph Theory 41: 292–306, 2002 相似文献
4.
5.
A. Khrennikov 《Annalen der Physik》2003,12(10):575-585
We study the probabilistic consequences of the choice of the basic number field in the quantum formalism. We demonstrate that by choosing a number field for a linear space representation of quantum model it is possible to describe various interference phenomena. We analyse interference of probabilistic alternatives induced by real, complex, hyperbolic (Clifford) and p‐adic representations. 相似文献
6.
7.
Zuo LIU Zhen De WU 《数学学报(英文版)》2005,21(5):997-1000
Let κ be non-negative integer. The unoriented bordism classes, which can be represented as [RP(ξ^κ)] where ξ^κ is a k-plane bundle, form an ideal of the unoriented bordism ring MO.. A group of generators of this ideal expressed by a base of MO. and a necessary and sufficient condition for a bordism class to belong to this ideal are given. 相似文献
8.
Xuding Zhu 《Journal of Graph Theory》2005,48(3):186-209
For 1 ≤ d ≤ k, let Kk/d be the graph with vertices 0, 1, …, k ? 1, in which i ~j if d ≤ |i ? j| ≤ k ? d. The circular chromatic number χc(G) of a graph G is the minimum of those k/d for which G admits a homomorphism to Kk/d. The circular clique number ωc(G) of G is the maximum of those k/d for which Kk/d admits a homomorphism to G. A graph G is circular perfect if for every induced subgraph H of G, we have χc(H) = ωc(H). In this paper, we prove that if G is circular perfect then for every vertex x of G, NG[x] is a perfect graph. Conversely, we prove that if for every vertex x of G, NG[x] is a perfect graph and G ? N[x] is a bipartite graph with no induced P5 (the path with five vertices), then G is a circular perfect graph. In a companion paper, we apply the main result of this paper to prove an analog of Haj?os theorem for circular chromatic number for k/d ≥ 3. Namely, we shall design a few graph operations and prove that for any k/d ≥ 3, starting from the graph Kk/d, one can construct all graphs of circular chromatic number at least k/d by repeatedly applying these graph operations. © 2005 Wiley Periodicals, Inc. J Graph Theory 48: 186–209, 2005 相似文献
9.
This paper presents an evaluation of the capability of turbulence models available in the commercial CFD code FLUENT 6.0 for their application to hydrofoil turbulent boundary layer separation flow at high Reynolds numbers. Four widely applied two‐equation RANS turbulence models were assessed through comparison with experimental data at Reynolds numbers of 8.284×106 and 1.657×107. They were the standard k–εmodel, the realizable k–εmodel, the standard k–ωmodel and the shear‐stress‐transport (SST) k–ωmodel. It has found that the realizable k–εturbulence model used with enhanced wall functions and near‐wall modelling techniques, consistently provides superior performance in predicting the flow characteristics around the hydrofoil. Copyright © 2004 John Wiley & Sons, Ltd. 相似文献
10.
A method for computing low Mach number flows using high‐resolution interpolation and difference formulas, within the framework of the Marker and Cell (MAC) scheme, is presented. This increases the range of wavenumbers that are properly resolved on a given grid so that a sufficiently accurate solution can be obtained without extensive grid refinement. Results using this scheme are presented for three problems. The first is the two‐dimensional Taylor–Green flow which has a closed form solution. The second is the evolution of perturbations to constant‐density, plane channel flow for which linear stability solutions are known. The third is the oscillatory instability of a variable density plane jet. In this case, unless the sharp density gradients are resolved, the calculations would breakdown. Under‐resolved calculations gave solutions containing vortices which grew in place rather than being convected out. With the present scheme, regular oscillations of this instability were obtained and vortices were convected out regularly. Stable computations were possible over a wider range of sensitive parameters such as density ratio and co‐flow velocity ratio. Copyright © 2004 John Wiley Sons, Ltd. 相似文献