全文获取类型
收费全文 | 2596篇 |
免费 | 178篇 |
国内免费 | 84篇 |
专业分类
化学 | 98篇 |
晶体学 | 2篇 |
力学 | 42篇 |
综合类 | 29篇 |
数学 | 2528篇 |
物理学 | 159篇 |
出版年
2024年 | 10篇 |
2023年 | 47篇 |
2022年 | 71篇 |
2021年 | 47篇 |
2020年 | 102篇 |
2019年 | 97篇 |
2018年 | 93篇 |
2017年 | 85篇 |
2016年 | 64篇 |
2015年 | 55篇 |
2014年 | 91篇 |
2013年 | 221篇 |
2012年 | 75篇 |
2011年 | 133篇 |
2010年 | 132篇 |
2009年 | 242篇 |
2008年 | 191篇 |
2007年 | 146篇 |
2006年 | 151篇 |
2005年 | 94篇 |
2004年 | 87篇 |
2003年 | 89篇 |
2002年 | 75篇 |
2001年 | 61篇 |
2000年 | 65篇 |
1999年 | 59篇 |
1998年 | 48篇 |
1997年 | 43篇 |
1996年 | 23篇 |
1995年 | 16篇 |
1994年 | 14篇 |
1993年 | 16篇 |
1992年 | 16篇 |
1991年 | 14篇 |
1990年 | 15篇 |
1989年 | 13篇 |
1988年 | 11篇 |
1987年 | 2篇 |
1986年 | 3篇 |
1985年 | 11篇 |
1984年 | 10篇 |
1983年 | 4篇 |
1982年 | 4篇 |
1981年 | 2篇 |
1979年 | 2篇 |
1978年 | 2篇 |
1977年 | 2篇 |
1972年 | 1篇 |
1970年 | 1篇 |
1957年 | 1篇 |
排序方式: 共有2858条查询结果,搜索用时 687 毫秒
991.
Ángela Jiménez‐Casas Aníbal Rodríguez‐Bernal 《Mathematical Methods in the Applied Sciences》2017,40(11):3982-4000
Starting form basic principles, we obtain mathematical models that describe the traffic of material objects in a network represented by a graph. We analyze existence, uniqueness, and positivity of solutions for some implicit models. Also, some linear models and their equilibria are analyzed. Copyright © 2017 John Wiley & Sons, Ltd. 相似文献
992.
Tilen Marc 《Journal of Graph Theory》2017,86(4):406-421
Partial cubes are graphs isometrically embeddable into hypercubes. In this article, it is proved that every cubic, vertex‐transitive partial cube is isomorphic to one of the following graphs: , for , the generalized Petersen graph G (10, 3), the cubic permutahedron, the truncated cuboctahedron, or the truncated icosidodecahedron. This classification is a generalization of results of Bre?ar et al. (Eur J Combin 25 (2004), 55–64) on cubic mirror graphs; it includes all cubic, distance‐regular partial cubes (P. M. Weichsel, Discrete Math 109 (1992), 297–306), and presents a contribution to the classification of all cubic partial cubes. 相似文献
993.
A graph G is called ‐choosable if for any list assignment L that assigns to each vertex v a set of a permissible colors, there is a b‐tuple L‐coloring of G . An (a , 1)‐choosable graph is also called a‐choosable. In the pioneering article on list coloring of graphs by Erd?s et al. 2 , 2‐choosable graphs are characterized. Confirming a special case of a conjecture in 2 , Tuza and Voigt 3 proved that 2‐choosable graphs are ‐choosable for any positive integer m . On the other hand, Voigt 6 proved that if m is an odd integer, then these are the only ‐choosable graphs; however, when m is even, there are ‐choosable graphs that are not 2‐choosable. A graph is called 3‐choosable‐critical if it is not 2‐choosable, but all its proper subgraphs are 2‐choosable. Voigt conjectured that for every positive integer m , all bipartite 3‐choosable‐critical graphs are ‐choosable. In this article, we determine which 3‐choosable‐critical graphs are (4, 2)‐choosable, refuting Voigt's conjecture in the process. Nevertheless, a weaker version of the conjecture is true: we prove that there is an even integer k such that for any positive integer m , every bipartite 3‐choosable‐critical graph is ‐choosable. Moving beyond 3‐choosable‐critical graphs, we present an infinite family of non‐3‐choosable‐critical graphs that have been shown by computer analysis to be (4, 2)‐choosable. This shows that the family of all (4, 2)‐choosable graphs has rich structure. 相似文献
994.
Michael Stiebitz 《Journal of Graph Theory》2017,85(1):278-287
The Erd?s–Lovász Tihany conjecture asserts that every graph G with ) contains two vertex disjoint subgraphs G 1 and G 2 such that and . Under the same assumption on G , we show that there are two vertex disjoint subgraphs G 1 and G 2 of G such that (a) and or (b) and . Here, is the chromatic number of is the clique number of G , and col(G ) is the coloring number of G . 相似文献
995.
We study the class of 1‐perfectly orientable graphs, that is, graphs having an orientation in which every out‐neighborhood induces a tournament. 1‐perfectly orientable graphs form a common generalization of chordal graphs and circular arc graphs. Even though they can be recognized in polynomial time, little is known about their structure. In this article, we develop several results on 1‐perfectly orientable graphs. In particular, we (i) give a characterization of 1‐perfectly orientable graphs in terms of edge clique covers, (ii) identify several graph transformations preserving the class of 1‐perfectly orientable graphs, (iii) exhibit an infinite family of minimal forbidden induced minors for the class of 1‐perfectly orientable graphs, and (iv) characterize the class of 1‐perfectly orientable graphs within the classes of cographs and of cobipartite graphs. The class of 1‐perfectly orientable cobipartite graphs coincides with the class of cobipartite circular arc graphs. 相似文献
996.
A k‐weak bisection of a cubic graph G is a partition of the vertex‐set of G into two parts V1 and V2 of equal size, such that each connected component of the subgraph of G induced by () is a tree of at most vertices. This notion can be viewed as a relaxed version of nowhere‐zero flows, as it directly follows from old results of Jaeger that every cubic graph G with a circular nowhere‐zero r‐flow has a ‐weak bisection. In this article, we study problems related to the existence of k‐weak bisections. We believe that every cubic graph that has a perfect matching, other than the Petersen graph, admits a 4‐weak bisection and we present a family of cubic graphs with no perfect matching that do not admit such a bisection. The main result of this article is that every cubic graph admits a 5‐weak bisection. When restricted to bridgeless graphs, that result would be a consequence of the assertion of the 5‐flow Conjecture and as such it can be considered a (very small) step toward proving that assertion. However, the harder part of our proof focuses on graphs that do contain bridges. 相似文献
997.
We present a new construction of the Student and Student-like fractal activity time model for risky asset. The construction uses the diffusion processes and their superpositions and allows for specified exact Student or Student-like marginal distributions of the returns and for flexible and tractable dependence structure. The fractal activity time is asymptotically self-similar, which is a desired feature seen in practice. 相似文献
998.
Herbert Fleischner 《Discrete Mathematics》2017,340(11):2714-2722
Viewing fullerenes as plane graphs with facial cycles being pentagonal and hexagonal only, it is shown how to reduce an arbitrary fullerene to the (graph of the) dodecahedron. This can be achieved by a sequence of eight reduction steps, seven of which are local operations and the remaining reduction step acts globally. In any case, the resulting algorithm has polynomial running time. 相似文献
999.
The decycling number of a graph is the smallest number of vertices which can be removed from so that the resultant graph contains no cycle. A decycling set containing exactly vertices of is called a -set. For any decycling set of a -regular graph , we show that , where is the cycle rank of , is the margin number of , and are, respectively, the number of components of and the number of edges in . In particular, for any -set of a 3-regular graph , we prove that , where is the Betti deficiency of . This implies that the decycling number of a 3-regular graph is . Hence for a 3-regular upper-embeddable graph , which concludes the results in [Gao et al., 2015, Wei and Li, 2013] and solves two open problems posed by Bau and Beineke (2002). Considering an algorithm by Furst et al., (1988), there exists a polynomial time algorithm to compute , the cardinality of a maximum nonseparating independent set in a -regular graph , which solves an open problem raised by Speckenmeyer (1988). As for a 4-regular graph , we show that for any -set of , there exists a spanning tree of such that the elements of are simply the leaves of with at most two exceptions providing . On the other hand, if is a loopless graph on vertices with maximum degree at most , then The above two upper bounds are tight, and this makes an extension of a result due to Punnim (2006). 相似文献
1000.
《Mathematische Nachrichten》2017,290(1):97-119
Let be the complete metric graph on d vertices. We compute the gonality of graphs obtained from by omitting edges forming a , or general configurations of at most edges. We also investigate if these graphs can be lifted to curves with the same gonality. We lift the former graphs and the ones obtained by removing up to edges not forming a K 3 using models of plane curves with certain singularities. We also study the gonality when removing edges not forming a K 3. We use harmonic morphism to lift these graphs to curves with the same gonality because in this case plane singular models can no longer be used due to a result of Coppens and Kato. 相似文献