全文获取类型
收费全文 | 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条查询结果,搜索用时 46 毫秒
11.
We study vertex‐colorings of plane graphs that do not contain a rainbow face, i.e., a face with vertices of mutually distinct colors. If G is a 3 ‐connected plane graph with n vertices, then the number of colors in such a coloring does not exceed . If G is 4 ‐connected, then the number of colors is at most , and for n≡3(mod8), it is at most . Finally, if G is 5 ‐connected, then the number of colors is at most . The bounds for 3 ‐connected and 4 ‐connected plane graphs are the best possible as we exhibit constructions of graphs with colorings matching the bounds. © 2009 Wiley Periodicals, Inc. J Graph Theory 63: 129–145, 2010 相似文献
12.
13.
14.
15.
Mossel and Ross raised the question of when a random coloring of a graph can be reconstructed from local information, namely, the colorings (with multiplicity) of balls of given radius. In this article, we are concerned with random 2-colorings of the vertices of the -dimensional hypercube, or equivalently random Boolean functions. In the worst case, balls of diameter are required to reconstruct. However, the situation for random colorings is dramatically different: we show that almost every 2-coloring can be reconstructed from the multiset of colorings of balls of radius 2. Furthermore, we show that for , almost every -coloring can be reconstructed from the multiset of colorings of 1-balls. 相似文献
16.
Let consist of all simple graphs on 2k vertices and edges. For a simple graph G and a positive integer , let denote the number of proper vertex colorings of G in at most colors, and let . We prove that and is the only extremal graph. We also prove that as . © 2007 Wiley Periodicals, Inc. J Graph Theory 56: 135–148, 2007 相似文献
17.
18.
It is shown that for each integer m ≥ 1 there exists a lower bound, vm, with the property that for all v ≥ vm with v ≡ 1, 4 (mod 12) there exists an m-chromatic S(2, 4, v) design. © 1998 John Wiley & Sons, Inc. J Combin Designs 6: 403–409, 1998 相似文献
19.
Given a graph G of order n containing no C4, color an edge e of the complement of G red if G+e contains a C4, and blue otherwise. Among other results, we answer a question of Erdős, de la Vina, and Fajtlowicz by showing that neither the red nor the blue graph obtained need contain a large complete subgraph. © 1998 John Wiley & Sons, Inc. Random Struct. Alg., 12 : 1–25, 1998 相似文献
20.
A k‐critical (multi‐) graph G has maximum degree k, chromatic index χ′(G) = k + 1, and χ′(G − e) < k + 1 for each edge e of G. For each k ≥ 3, we construct k‐critical (multi‐) graphs with certain properties to obtain counterexamples to some well‐known conjectures. © 1999 John Wiley & Sons, Inc. J Graph Theory 30: 27–36, 1999 相似文献