全文获取类型
收费全文 | 1035篇 |
免费 | 109篇 |
国内免费 | 49篇 |
专业分类
化学 | 15篇 |
综合类 | 11篇 |
数学 | 1127篇 |
物理学 | 40篇 |
出版年
2023年 | 17篇 |
2022年 | 31篇 |
2021年 | 15篇 |
2020年 | 55篇 |
2019年 | 41篇 |
2018年 | 41篇 |
2017年 | 41篇 |
2016年 | 27篇 |
2015年 | 24篇 |
2014年 | 59篇 |
2013年 | 90篇 |
2012年 | 60篇 |
2011年 | 83篇 |
2010年 | 75篇 |
2009年 | 107篇 |
2008年 | 88篇 |
2007年 | 43篇 |
2006年 | 72篇 |
2005年 | 41篇 |
2004年 | 33篇 |
2003年 | 23篇 |
2002年 | 28篇 |
2001年 | 15篇 |
2000年 | 17篇 |
1999年 | 18篇 |
1998年 | 10篇 |
1997年 | 11篇 |
1996年 | 1篇 |
1995年 | 6篇 |
1994年 | 4篇 |
1993年 | 3篇 |
1992年 | 1篇 |
1990年 | 3篇 |
1989年 | 1篇 |
1988年 | 1篇 |
1987年 | 1篇 |
1985年 | 2篇 |
1984年 | 3篇 |
1981年 | 2篇 |
排序方式: 共有1193条查询结果,搜索用时 46 毫秒
61.
Po‐Shen Loh 《Random Structures and Algorithms》2014,44(3):328-354
One of the most famous results in the theory of random graphs establishes that the threshold for Hamiltonicity in the Erd?s‐Rényi random graph Gn,p is around . Much research has been done to extend this to increasingly challenging random structures. In particular, a recent result by Frieze determined the asymptotic threshold for a loose Hamilton cycle in the random 3‐uniform hypergraph by connecting 3‐uniform hypergraphs to edge‐colored graphs. In this work, we consider that setting of edge‐colored graphs, and prove a result which achieves the best possible first order constant. Specifically, when the edges of Gn,p are randomly colored from a set of (1 + o(1))n colors, with , we show that one can almost always find a Hamilton cycle which has the additional property that all edges are distinctly colored (rainbow).Copyright © 2013 Wiley Periodicals, Inc. Random Struct. Alg., 44, 328‐354, 2014 相似文献
62.
Let G be a connected graph with maximum degree Δ≥ 3.We investigate the upper bound for the chromatic number χγ(G) of the power graph Gγ.It was proved that χγ(G) ≤Δ(Δ-1)γ-1Δ-2+ 1 =:M + 1,where the equality holds if and only if G is a Moore graph.If G is not a Moore graph,and G satisfies one of the following conditions:(1) G is non-regular,(2) the girth g(G) ≤ 2γ- 1,(3)g(G) ≥ 2γ + 2,and the connectivity κ(G) ≥ 3 if γ≥ 3,κ(G) ≥ 4 but g(G) 6 if γ = 2,(4) Δis sufficiently larger than a given number only depending on γ,then χγ(G) ≤ M- 1.By means of the spectral radius λ1(G) of the adjacency matrix of G,it was shown that χ2(G) ≤λ1(G)2+ 1,where the equality holds if and only if G is a star or a Moore graph with diameter 2 and girth 5,and χγ(G)λ1(G)γ+1 ifγ≥3. 相似文献
63.
CHEN XIANG-EN HE WEN-YU LI ZE-PENG YAO BING 《数学研究通讯:英文版》2014,(3):222-236
Let G be a simple graph. An IE-total coloring f of G refers to a coloring of the vertices and edges of G so that no two adjacent vertices receive the same color. Let C(u) be the set of colors of vertex u and edges incident to u under f. For an IE-total coloring f of G using k colors, if C(u)=C(v) for any two different vertices u and v of V (G), then f is called a k-vertex-distinguishing IE-total-coloring of G, or a k-VDIET coloring of G for short. The minimum number of colors required for a VDIET coloring of G is denoted by χievt(G), and is called the VDIET chromatic number of G. We get the VDIET chromatic numbers of cycles and wheels, and propose related conjectures in this paper. 相似文献
64.
《Journal of computational science》2014,5(1):1-11
Partial differential equations can be discretized using a regular Cartesian grid and a stencil-based method to approximate the partial derivatives. The computational effort for determining the associated Jacobian matrix can be reduced. This reduction can be modeled as a (grid) coloring problem. Currently, this problem is solved by using a heuristic approach for general graphs or by developing a formula for every single stencil. We introduce a sub-exponential algorithm using the Lipton–Tarjan separator in a divide-and-conquer approach to compute an optimal coloring. The practical relevance of the algorithm is evaluated when compared with an exponential algorithm and a greedy heuristic. 相似文献
65.
应用构造染色函数法研究了冠图C_m·C_n、C_m·C_n的邻点可区别V-全染色.通过对P_m·C_n的邻点可区别V-全染色的研究巧妙给出了C_m·C_n邻点可区别V-全染色,并得到了这些图的邻点可区别V-全色数,从而验证了图的邻点可区别V-全染色猜想. 相似文献
66.
A proper edge coloring of a graph G is acyclic if there is no 2-colored cycle in G. The acyclic chromatic index of G, denoted by χ a(G), is the least number of colors such that G has an acyclic edge coloring. A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, it is proved that χ a(G) ≤Δ(G) + 22, if G is a triangle-free 1-planar graph. 相似文献
67.
A generalization of Zellner’s balanced loss function is proposed. General admissibility in a general multivariate linear model is investigated under the generalized balanced loss function. And the sufficient and necessary conditions for linear estimators to be generally admissible in classes of homogeneous and nonhomogeneous linear estimators are given, respectively. 相似文献
68.
69.
This paper describes an exact algorithm for the Equitable Coloring Problem, based on the well known DSatur algorithm for the classic Coloring Problem with new pruning rules specifically derived from the equity constraint. Computational experiences show that our algorithm is competitive with those known in literature. 相似文献
70.
V.V. Mkrtchyan 《Discrete Mathematics》2006,306(4):456-459
I prove that in a tree in which the distance between any two endpoints is even, there is a maximum proper partial 0-1 coloring such that the edges colored by 0 form a maximum matching. 相似文献