全文获取类型
收费全文 | 2408篇 |
免费 | 159篇 |
国内免费 | 75篇 |
专业分类
化学 | 75篇 |
晶体学 | 1篇 |
力学 | 4篇 |
综合类 | 29篇 |
数学 | 2434篇 |
物理学 | 99篇 |
出版年
2024年 | 10篇 |
2023年 | 46篇 |
2022年 | 62篇 |
2021年 | 45篇 |
2020年 | 98篇 |
2019年 | 92篇 |
2018年 | 86篇 |
2017年 | 83篇 |
2016年 | 57篇 |
2015年 | 47篇 |
2014年 | 80篇 |
2013年 | 207篇 |
2012年 | 68篇 |
2011年 | 125篇 |
2010年 | 127篇 |
2009年 | 231篇 |
2008年 | 185篇 |
2007年 | 138篇 |
2006年 | 145篇 |
2005年 | 86篇 |
2004年 | 84篇 |
2003年 | 82篇 |
2002年 | 69篇 |
2001年 | 58篇 |
2000年 | 56篇 |
1999年 | 51篇 |
1998年 | 44篇 |
1997年 | 37篇 |
1996年 | 22篇 |
1995年 | 7篇 |
1994年 | 13篇 |
1993年 | 13篇 |
1992年 | 8篇 |
1991年 | 8篇 |
1990年 | 11篇 |
1989年 | 11篇 |
1988年 | 9篇 |
1987年 | 2篇 |
1986年 | 3篇 |
1985年 | 11篇 |
1984年 | 10篇 |
1983年 | 3篇 |
1982年 | 4篇 |
1981年 | 2篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1978年 | 2篇 |
1977年 | 1篇 |
1970年 | 1篇 |
排序方式: 共有2642条查询结果,搜索用时 62 毫秒
81.
In the game of cops and robber, the cops try to capture a robber moving on the vertices of the graph. The minimum number of cops required to win on a given graph G is called the cop number of G. The biggest open conjecture in this area is the one of Meyniel, which asserts that for some absolute constant C, the cop number of every connected graph G is at most . In a separate paper, we showed that Meyniel's conjecture holds asymptotically almost surely for the binomial random graph. The result was obtained by showing that the conjecture holds for a general class of graphs with some specific expansion‐type properties. In this paper, this deterministic result is used to show that the conjecture holds asymptotically almost surely for random d‐regular graphs when d = d(n) ≥ 3. 相似文献
82.
83.
85.
Eckhard Steffen 《Journal of Graph Theory》2015,78(3):195-206
Let G be a bridgeless cubic graph. Consider a list of k 1‐factors of G. Let be the set of edges contained in precisely i members of the k 1‐factors. Let be the smallest over all lists of k 1‐factors of G. Any list of three 1‐factors induces a core of a cubic graph. We use results on the structure of cores to prove sufficient conditions for Berge‐covers and for the existence of three 1‐factors with empty intersection. Furthermore, if , then is an upper bound for the girth of G. We also prove some new upper bounds for the length of shortest cycle covers of bridgeless cubic graphs. Cubic graphs with have a 4‐cycle cover of length and a 5‐cycle double cover. These graphs also satisfy two conjectures of Zhang 18 . We also give a negative answer to a problem stated in 18 . 相似文献
86.
We prove part of a conjecture by Johansson, Kahn, and Vu (Factors in random graphs, Random Struct. Algorithms 33 (2008), 1, 1–28.) regarding threshold functions for the existence of an H‐factor in a random graph . We prove that the conjectured threshold function is correct for any graph H which is not covered by its densest subgraphs. We also demonstrate that the main result of Johansson, Kahn, and Vu (Factors in random graphs, Random Struct. Algorithms 33 (2008), 1, 1–28) generalizes to multigraphs, digraphs, and a multipartite model. 相似文献
87.
The independence number of a sparse random graph G(n,m) of average degree d = 2m/n is well‐known to be with high probability, with in the limit of large d. Moreover, a trivial greedy algorithm w.h.p. finds an independent set of size , i.e., about half the maximum size. Yet in spite of 30 years of extensive research no efficient algorithm has emerged to produce an independent set with size for any fixed (independent of both d and n). In this paper we prove that the combinatorial structure of the independent set problem in random graphs undergoes a phase transition as the size k of the independent sets passes the point . Roughly speaking, we prove that independent sets of size form an intricately rugged landscape, in which local search algorithms seem to get stuck. We illustrate this phenomenon by providing an exponential lower bound for the Metropolis process, a Markov chain for sampling independent sets. © 2014 Wiley Periodicals, Inc. Random Struct. Alg., 47, 436–486, 2015 相似文献
88.
89.
《Discrete Mathematics》2023,346(1):113188
In this addendum we give a short and easy negative answer to the two questions raised in the original article. 相似文献
90.