全文获取类型
收费全文 | 2856篇 |
免费 | 174篇 |
国内免费 | 130篇 |
专业分类
化学 | 118篇 |
晶体学 | 1篇 |
力学 | 11篇 |
综合类 | 34篇 |
数学 | 2835篇 |
物理学 | 161篇 |
出版年
2024年 | 13篇 |
2023年 | 56篇 |
2022年 | 75篇 |
2021年 | 54篇 |
2020年 | 108篇 |
2019年 | 107篇 |
2018年 | 97篇 |
2017年 | 98篇 |
2016年 | 70篇 |
2015年 | 53篇 |
2014年 | 89篇 |
2013年 | 243篇 |
2012年 | 78篇 |
2011年 | 138篇 |
2010年 | 139篇 |
2009年 | 244篇 |
2008年 | 213篇 |
2007年 | 155篇 |
2006年 | 165篇 |
2005年 | 107篇 |
2004年 | 111篇 |
2003年 | 117篇 |
2002年 | 99篇 |
2001年 | 83篇 |
2000年 | 75篇 |
1999年 | 72篇 |
1998年 | 72篇 |
1997年 | 58篇 |
1996年 | 28篇 |
1995年 | 11篇 |
1994年 | 16篇 |
1993年 | 16篇 |
1992年 | 8篇 |
1991年 | 8篇 |
1990年 | 11篇 |
1989年 | 13篇 |
1988年 | 10篇 |
1987年 | 7篇 |
1986年 | 4篇 |
1985年 | 13篇 |
1984年 | 11篇 |
1983年 | 3篇 |
1982年 | 4篇 |
1981年 | 2篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1978年 | 2篇 |
1977年 | 1篇 |
1970年 | 1篇 |
排序方式: 共有3160条查询结果,搜索用时 15 毫秒
151.
For graphs G and F, write if any coloring of the edges of G with colors yields a monochromatic copy of the graph F. Suppose is obtained from a graph S with s vertices and maximum degree d by subdividing its edges h times (that is, by replacing the edges of S by paths of length h + 1). We prove that there exists a graph G with no more than edges for which holds, provided that . We also extend this result to the case in which Q is a graph with maximum degree d on q vertices with the property that every pair of vertices of degree greater than 2 are distance at least h + 1 apart. This complements work of Pak regarding the size Ramsey number of “long subdivisions” of bounded degree graphs. 相似文献
152.
Graph symmetries intervene in diverse applications, from enumeration, to graph structure compression, to the discovery of graph dynamics (e.g., node arrival order inference). Whereas Erd?s‐Rényi graphs are typically asymmetric, real networks are highly symmetric. So a natural question is whether preferential attachment graphs, where in each step a new node with m edges is added, exhibit any symmetry. In recent work it was proved that preferential attachment graphs are symmetric for m = 1, and there is some nonnegligible probability of symmetry for m = 2. It was conjectured that these graphs are asymmetric when m ≥ 3. We settle this conjecture in the affirmative, then use it to estimate the structural entropy of the model. To do this, we also give bounds on the number of ways that the given graph structure could have arisen by preferential attachment. These results have further implications for information theoretic problems of interest on preferential attachment graphs. 相似文献
153.
Ariane Carrance 《Random Structures and Algorithms》2019,55(3):615-648
We present here random distributions on (D + 1)‐edge‐colored, bipartite graphs with a fixed number of vertices 2p. These graphs encode D‐dimensional orientable colored complexes. We investigate the behavior of those graphs as p→∞. The techniques involved in this study also yield a Central Limit Theorem for the genus of a uniform map of order p, as p→∞. 相似文献
154.
155.
David Ellison 《Discrete Mathematics》2019,342(3):917-925
In the game of cops and robbers on graphs, the cops and the robber are allowed to pass their turn if they are located on a looped vertex. This paper explores the effect of loops on the cop number and the capture time. We provide examples of graphs where the cop number almost doubles when the loops are removed, graphs where the cop number decreases when the loops are removed, graphs where the capture time is quadratic in the number of vertices and copwin graphs where the cop needs to move away from the robber in optimal play. 相似文献
156.
157.
For an integer , a graph is -hamiltonian if for any vertex subset with , is hamiltonian, and is -hamiltonian connected if for any vertex subset with , is hamiltonian connected. Thomassen in 1984 conjectured that every 4-connected line graph is hamiltonian (see Thomassen, 1986), and Ku?zel and Xiong in 2004 conjectured that every 4-connected line graph is hamiltonian connected (see Ryjá?ek and Vrána, 2011). In Broersma and Veldman (1987), Broersma and Veldman raised the characterization problem of -hamiltonian line graphs. In Lai and Shao (2013), it is conjectured that for , a line graph is -hamiltonian if and only if is -connected. In this paper we prove the following.(i) For an integer , the line graph of a claw-free graph is -hamiltonian if and only if is -connected.(ii) The line graph of a claw-free graph is 1-hamiltonian connected if and only if is 4-connected. 相似文献
158.
A graph is -colorable if it admits a vertex partition into a graph with maximum degree at most and a graph with maximum degree at most . We show that every -free planar graph is -colorable. We also show that deciding whether a -free planar graph is -colorable is NP-complete. 相似文献
159.
160.
《Discrete Mathematics》2019,342(10):2770-2782
“Which graphs are determined by their spectrum (DS for short)?” is a fundamental question in spectral graph theory. It is generally very hard to show a given graph to be DS and few results about DS graphs are known in literature. In this paper, we consider the above problem in the context of the generalized -spectrum. A graph is said to be determined by the generalized -spectrum (DGQS for short) if, for any graph , and have the same -spectrum and so do their complements imply that is isomorphic to . We give a simple arithmetic condition for a graph being DGQS. More precisely, let be a graph with adjacency matrix and degree diagonal matrix . Let be the signless Laplacian matrix of , and ( is the all-ones vector) be the -walk matrix. We show that if (which is always an integer) is odd and square-free, then is DGQS. 相似文献