全文获取类型
收费全文 | 1743篇 |
免费 | 19篇 |
国内免费 | 55篇 |
专业分类
化学 | 98篇 |
晶体学 | 1篇 |
力学 | 8篇 |
综合类 | 4篇 |
数学 | 1644篇 |
物理学 | 62篇 |
出版年
2023年 | 33篇 |
2022年 | 30篇 |
2021年 | 26篇 |
2020年 | 39篇 |
2019年 | 65篇 |
2018年 | 40篇 |
2017年 | 27篇 |
2016年 | 12篇 |
2015年 | 24篇 |
2014年 | 55篇 |
2013年 | 137篇 |
2012年 | 55篇 |
2011年 | 132篇 |
2010年 | 114篇 |
2009年 | 192篇 |
2008年 | 185篇 |
2007年 | 130篇 |
2006年 | 94篇 |
2005年 | 39篇 |
2004年 | 38篇 |
2003年 | 44篇 |
2002年 | 34篇 |
2001年 | 29篇 |
2000年 | 28篇 |
1999年 | 17篇 |
1998年 | 31篇 |
1997年 | 20篇 |
1996年 | 24篇 |
1995年 | 15篇 |
1994年 | 9篇 |
1993年 | 9篇 |
1992年 | 9篇 |
1991年 | 7篇 |
1990年 | 5篇 |
1989年 | 3篇 |
1988年 | 3篇 |
1987年 | 1篇 |
1986年 | 13篇 |
1985年 | 10篇 |
1984年 | 10篇 |
1983年 | 3篇 |
1982年 | 8篇 |
1981年 | 6篇 |
1980年 | 3篇 |
1979年 | 1篇 |
1978年 | 5篇 |
1977年 | 2篇 |
1972年 | 1篇 |
排序方式: 共有1817条查询结果,搜索用时 15 毫秒
1.
2.
3.
4.
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. 相似文献
5.
6.
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 Γ. 相似文献
7.
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. 相似文献
8.
Brian Lucena 《Discrete Applied Mathematics》2007,155(8):1055-1065
One consequence of the graph minor theorem is that for every k there exists a finite obstruction set Obs(TW?k). However, relatively little is known about these sets, and very few general obstructions are known. The ones that are known are the cliques, and graphs which are formed by removing a few edges from a clique. This paper gives several general constructions of minimal forbidden minors which are sparse in the sense that the ratio of the treewidth to the number of vertices n does not approach 1 as n approaches infinity. We accomplish this by a novel combination of using brambles to provide lower bounds and achievable sets to demonstrate upper bounds. Additionally, we determine the exact treewidth of other basic graph constructions which are not minimal forbidden minors. 相似文献
9.
This paper proposes a perturbation-based heuristic for the capacitated multisource Weber problem. This procedure is based on an effective use of borderline customers. Several implementations are considered and the two most appropriate are then computationally enhanced by using a reduced neighbourhood when solving the transportation problem. Computational results are presented using data sets from the literature, originally used for the uncapacitated case, with encouraging results. 相似文献
10.
Peter Francis Guangming Zhang Karen Smilowitz 《European Journal of Operational Research》2007,180(3):1045-1059
This paper presents modeling and solution method improvements for the Multi-Resource Routing Problem (MRRP) with flexible tasks. The MRRP with flexible tasks is used to model routing and scheduling problems for intermodal drayage operations in which two resources (tractors and trailers) perform tasks to transport loaded and empty equipment. Tasks may be either well defined, in which both the origin and the destination of a movement are given, or flexible, in which the origin or the destination is chosen by the model. This paper proposes methods to effectively manage the number of options considered for flexible tasks (either feasible origins for a known destination or feasible destinations for a known origin). This modeling change generates sufficient options to allow for low-cost solutions while maintaining reasonable computational effort. We also propose a new solution method that uses randomized route generation. Computational results from test cases show that these changes improve the quality of solutions by at least 5% in the test cases as compared to methods from previous studies. 相似文献