全文获取类型
收费全文 | 94篇 |
免费 | 15篇 |
专业分类
化学 | 2篇 |
数学 | 104篇 |
物理学 | 3篇 |
出版年
2023年 | 3篇 |
2022年 | 2篇 |
2021年 | 1篇 |
2020年 | 7篇 |
2019年 | 7篇 |
2018年 | 6篇 |
2017年 | 3篇 |
2016年 | 3篇 |
2015年 | 2篇 |
2014年 | 8篇 |
2013年 | 5篇 |
2012年 | 1篇 |
2011年 | 6篇 |
2010年 | 6篇 |
2009年 | 6篇 |
2008年 | 7篇 |
2007年 | 8篇 |
2006年 | 5篇 |
2004年 | 1篇 |
2003年 | 4篇 |
2002年 | 2篇 |
2001年 | 2篇 |
2000年 | 2篇 |
1999年 | 2篇 |
1998年 | 5篇 |
1996年 | 1篇 |
1991年 | 1篇 |
1990年 | 1篇 |
1988年 | 1篇 |
1976年 | 1篇 |
排序方式: 共有109条查询结果,搜索用时 15 毫秒
51.
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. 相似文献
52.
对一个连通图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. 相似文献
53.
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 相似文献
54.
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. 相似文献
55.
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) 相似文献
56.
Motivated by the work of Ne?et?il and Rödl on “Partitions of vertices” we are interested in obtaining some quantitative extensions of their result. In particular, given a natural number r and a graph G of order m with odd girth g, we show the existence of a graph H with odd girth at least g and order that is polynomial in m such that every r‐coloring of the vertices of H yields a monochromatic and induced copy of G. © 2010 Wiley Periodicals, Inc. J Graph Theory 68: 255‐264, 2011 相似文献
57.
In this article, we consider Vizing's 2‐Factor Conjecture which claims that any Δ‐critical graph has a 2‐factor, and show that if G is a Δ‐critical graph with n vertices satisfying , then G is Hamiltonian and thus G has a 2‐factor. Meanwhile in this article, we also consider long cycles of overfull critical graphs and obtain that if G is an overfull Δ‐critical graph with n vertices, then the circumference of G is at least min.© 2012 Wiley Periodicals, Inc. J. Graph Theory 00: 1‐14, 2012 相似文献
58.
59.
Given a subgroup of the symmetric group , the cycle index polynomial is the average of the power-sum symmetric polynomials indexed by the cycle types of permutations in . By Pólya’s Theorem, the monomial expansion of is the generating function for weighted colorings of objects, where we identify colorings related by one of the symmetries in . This paper develops combinatorial formulas for the fundamental quasisymmetric expansions and Schur expansions of certain cycle index polynomials. We give explicit bijective proofs based on standardization algorithms applied to equivalence classes of colorings. Subgroups studied here include Young subgroups of , the alternating groups , direct products, conjugate subgroups, and certain cyclic subgroups of generated by . The analysis of these cyclic subgroups when is prime reveals an unexpected connection to perfect matchings on a hypercube with certain vertices identified. 相似文献
60.
Danila Cherkashin 《Discrete Mathematics》2018,341(3):652-657
This paper studies the quantity , that is the minimal number of edges of an -uniform hypergraph without panchromatic coloring (it means that every edge meets every color) in colors. If then all bounds have a type , where , are some algebraic fractions. The main result is a new lower bound on when is at least ; we improve an upper bound on if .Also we show that has upper and lower bounds depending only on when the ratio is small, which cannot be reached by the previous probabilistic machinery.Finally we construct an explicit example of a hypergraph without panchromatic coloring and with edges for . 相似文献