全文获取类型
收费全文 | 1490篇 |
免费 | 47篇 |
国内免费 | 58篇 |
专业分类
化学 | 120篇 |
晶体学 | 1篇 |
力学 | 38篇 |
综合类 | 15篇 |
数学 | 1340篇 |
物理学 | 81篇 |
出版年
2023年 | 34篇 |
2022年 | 32篇 |
2021年 | 28篇 |
2020年 | 45篇 |
2019年 | 66篇 |
2018年 | 35篇 |
2017年 | 33篇 |
2016年 | 24篇 |
2015年 | 26篇 |
2014年 | 51篇 |
2013年 | 126篇 |
2012年 | 45篇 |
2011年 | 101篇 |
2010年 | 94篇 |
2009年 | 153篇 |
2008年 | 141篇 |
2007年 | 82篇 |
2006年 | 82篇 |
2005年 | 35篇 |
2004年 | 43篇 |
2003年 | 45篇 |
2002年 | 36篇 |
2001年 | 30篇 |
2000年 | 27篇 |
1999年 | 18篇 |
1998年 | 25篇 |
1997年 | 14篇 |
1996年 | 16篇 |
1995年 | 14篇 |
1994年 | 7篇 |
1993年 | 10篇 |
1992年 | 9篇 |
1991年 | 7篇 |
1990年 | 7篇 |
1989年 | 3篇 |
1988年 | 3篇 |
1987年 | 1篇 |
1986年 | 12篇 |
1985年 | 6篇 |
1984年 | 6篇 |
1983年 | 3篇 |
1982年 | 6篇 |
1981年 | 5篇 |
1980年 | 2篇 |
1979年 | 1篇 |
1978年 | 3篇 |
1977年 | 2篇 |
1972年 | 1篇 |
排序方式: 共有1595条查询结果,搜索用时 31 毫秒
1.
We describe a unified approach for studying book, point-set, and simultaneous embeddability problems of upward planar digraphs. The approach is based on a linear time strategy to compute an upward planar drawing of an upward planar digraph such that all vertices are collinear. Besides having impact in relevant application domains of graph drawing and computational geometry, the presented results open new research directions in the area of upward planarity with constraints of the positions of the vertices. 相似文献
2.
3.
4.
5.
6.
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. 相似文献
7.
Jin Xie Yun-Wei Song Dr. Bo-Quan Li Dr. Hong-Jie Peng Prof. Jia-Qi Huang Prof. Qiang Zhang 《Angewandte Chemie (Weinheim an der Bergstrasse, Germany)》2020,132(49):22334-22339
Polysulfide intermediates (PSs), the liquid-phase species of active materials in lithium–sulfur (Li-S) batteries, connect the electrochemical reactions between insulative solid sulfur and lithium sulfide and are key to full exertion of the high-energy-density Li-S system. Herein, the concept of sulfur container additives is proposed for the direct modification on the PSs species. By reversible storage and release of the sulfur species, the container molecule converts small PSs into large organosulfur species. The prototype di(tri)sulfide-polyethylene glycol sulfur container is highly efficient in the reversible PS transformation to multiply affect electrochemical behaviors of sulfur cathodes in terms of liquid-species clustering, reaction kinetics, and solid deposition. The stability and capacity of Li-S cells was thereby enhanced. The sulfur container is a strategy to directly modify PSs, enlightening the precise regulation on Li-S batteries and multi-phase electrochemical systems. 相似文献
8.
A generalization of strong regularity around a vertex subset C of a graph Γ, which makes sense even if Γis non-regular, is studied. Such a structure appears, together with a kind of distance-regularity around C , when an spectral bound concerning the so-called predistance polynomial of C is attained. As a main consequence of these results, it is shown that a regular (connected) graph Γwith d + 1 distinct eigenvalues is distance-regular, and its distance- d graph Γ d is strongly regular with parameters a = c , if and only if the number of vertices at distance d from each vertex satisfies an expression which depends only on the order of Γand the different eigenvalues of Γ. 相似文献
9.
In a graph, a cluster is a set of vertices, and two clusters are said to be non-intersecting if they are disjoint or one of them is contained in the other. A clustered graph C consists of a graph G and a set of non-intersecting clusters. In this paper, we assume that C has a compound planar drawing and each cluster induces a biconnected subgraph. Then we show that such a clustered graph admits a drawing in the plane such that (i) edges are drawn as straight-line segments with no edge crossing and (ii) the boundary of the biconnected subgraph induced by each cluster is a convex polygon. 相似文献
10.
Let G=(V,E) be a undirected k-edge connected graph with weights ce on edges and wv on nodes. The minimum 2-edge connected subgraph problem, 2ECSP for short, is to find a 2-edge connected subgraph of G, of minimum total weight. The 2ECSP generalizes the well-known Steiner 2-edge connected subgraph problem. In this paper we study the convex hull of the incidence vectors corresponding to feasible solutions of 2ECSP. First, a natural integer programming formulation is given and it is shown that its linear relaxation is not sufficient to describe the polytope associated with 2ECSP even when G is series-parallel. Then, we introduce two families of new valid inequalities and we give sufficient conditions for them to be facet-defining. Later, we concentrate on the separation problem. We find polynomial time algorithms to solve the separation of important subclasses of the introduced inequalities, concluding that the separation of the new inequalities, when G is series-parallel, is polynomially solvable. 相似文献