全文获取类型
收费全文 | 146篇 |
免费 | 23篇 |
国内免费 | 1篇 |
专业分类
化学 | 9篇 |
数学 | 154篇 |
物理学 | 7篇 |
出版年
2023年 | 3篇 |
2022年 | 3篇 |
2021年 | 1篇 |
2020年 | 8篇 |
2019年 | 8篇 |
2018年 | 8篇 |
2017年 | 6篇 |
2016年 | 7篇 |
2015年 | 3篇 |
2014年 | 13篇 |
2013年 | 12篇 |
2012年 | 3篇 |
2011年 | 15篇 |
2010年 | 9篇 |
2009年 | 6篇 |
2008年 | 11篇 |
2007年 | 9篇 |
2006年 | 6篇 |
2005年 | 3篇 |
2004年 | 3篇 |
2003年 | 7篇 |
2002年 | 2篇 |
2001年 | 2篇 |
2000年 | 2篇 |
1999年 | 2篇 |
1998年 | 6篇 |
1997年 | 2篇 |
1996年 | 1篇 |
1993年 | 1篇 |
1991年 | 1篇 |
1990年 | 1篇 |
1988年 | 1篇 |
1987年 | 1篇 |
1984年 | 1篇 |
1982年 | 1篇 |
1976年 | 2篇 |
排序方式: 共有170条查询结果,搜索用时 312 毫秒
81.
82.
给出了一类无穷积分integral from n=0 to ∞ ( )(sin~r(αx)/x~s)cos~p(bx)的计算公式,其中α≠0,b≥0,r,s,p∈N={1,2,3,…}. 相似文献
83.
Paul Dorbec Tomáš Kaiser Mickael Montassier André Raspaud 《Journal of Graph Theory》2014,75(2):191-202
Let be nonnegative integers. A graph G is ‐colorable if its vertex set can be partitioned into sets such that the graph induced by has maximum degree at most d for , while the graph induced by is an edgeless graph for . In this article, we give two real‐valued functions and such that any graph with maximum average degree at most is ‐colorable, and there exist non‐‐colorable graphs with average degree at most . Both these functions converge (from below) to when d tends to infinity. This implies that allowing a color to be d‐improper (i.e., of type ) even for a large degree d increases the maximum average degree that guarantees the existence of a valid coloring only by 1. Using a color of type (even with a very large degree d) is somehow less powerful than using two colors of type (two stable sets). 相似文献
84.
Spencer N. Tofts 《Journal of Graph Theory》2014,75(3):275-283
Let denote Turán's graph—the complete 2‐partite graph on n vertices with partition sizes as equal as possible. We show that for all , the graph has more proper vertex colorings in at most 4 colors than any other graph with the same number of vertices and edges. 相似文献
85.
对一个连通图G,令d(u,v)表示G中两个顶点间u和v之间的距离,d表示G的直径.G的一个对极染色指的是从G的顶点集到正整数集(颜色集)的一个映射c,使得对G的任意两个不同的顶点u和v满足d(u,v)+|c(u)-c(v)|≥d.由c映射到G的顶点的最大颜色称为c的值,记作ac(c),而对G的所有对极染色c,ac(c)的最小值称为G的对极色数,记作ac(G).本文确定了轮图、齿轮图以及双星图三类图的对极色数,这些图都具有较小的直径d. 相似文献
86.
87.
Martin Dyer Alan Frieze Thomas P. Hayes Eric Vigoda 《Random Structures and Algorithms》2013,43(2):181-200
We study a simple Markov chain, known as the Glauber dynamics, for generating a random k ‐coloring of an n ‐vertex graph with maximum degree Δ. We prove that, for every ε > 0, the dynamics converges to a random coloring within O(nlog n) steps assuming k ≥ k0(ε) and either: (i) k/Δ > α* + ε where α*≈? 1.763 and the girth g ≥ 5, or (ii) k/Δ >β * + ε where β*≈? 1.489 and the girth g ≥ 7. Our work improves upon, and builds on, previous results which have similar restrictions on k/Δ and the minimum girth but also required Δ = Ω (log n). The best known result for general graphs is O(nlog n) mixing time when k/Δ > 2 and O(n2) mixing time when k/Δ > 11/6. Related results of Goldberg et al apply when k/Δ > α* for all Δ ≥ 3 on triangle‐free “neighborhood‐amenable” graphs.© 2012 Wiley Periodicals, Inc. Random Struct. Alg., 2013 相似文献
88.
An L(2,1)-coloring of a graph G is a coloring of G's vertices with integers in {0,1,…,k} so that adjacent vertices’ colors differ by at least two and colors of distance-two vertices differ. We refer to an L(2,1)-coloring as a coloring. The span λ(G) of G is the smallest k for which G has a coloring, a span coloring is a coloring whose greatest color is λ(G), and the hole index ρ(G) of G is the minimum number of colors in {0,1,…,λ(G)} not used in a span coloring. We say that G is full-colorable if ρ(G)=0. More generally, a coloring of G is a no-hole coloring if it uses all colors between 0 and its maximum color. Both colorings and no-hole colorings were motivated by channel assignment problems. We define the no-hole span μ(G) of G as ∞ if G has no no-hole coloring; otherwise μ(G) is the minimum k for which G has a no-hole coloring using colors in {0,1,…,k}.
Let n denote the number of vertices of G, and let Δ be the maximum degree of vertices of G. Prior work shows that all non-star trees with Δ3 are full-colorable, all graphs G with n=λ(G)+1 are full-colorable, μ(G)λ(G)+ρ(G) if G is not full-colorable and nλ(G)+2, and G has a no-hole coloring if and only if nλ(G)+1. We prove two extremal results for colorings. First, for every m1 there is a G with ρ(G)=m and μ(G)=λ(G)+m. Second, for every m2 there is a connected G with λ(G)=2m, n=λ(G)+2 and ρ(G)=m. 相似文献
89.
We deal here with colorings of the pair (μ+, μ), when μ is a strong limit and singular cardinal. We show that there exists a coloring c with no refinement. It follows that the properties of colorings of (μ+, μ) when μ is singular differ in an essential way from the case of regular μ (although the identities may be the same). (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim) 相似文献
90.