首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   50篇
  免费   7篇
综合类   1篇
数学   56篇
  2020年   1篇
  2019年   4篇
  2018年   2篇
  2017年   3篇
  2015年   1篇
  2014年   2篇
  2013年   5篇
  2012年   1篇
  2011年   7篇
  2010年   1篇
  2009年   11篇
  2008年   3篇
  2007年   1篇
  2006年   5篇
  2005年   2篇
  2004年   1篇
  2002年   3篇
  2001年   1篇
  1999年   2篇
  1998年   1篇
排序方式: 共有57条查询结果,搜索用时 125 毫秒
1.
寻找平面图是3-或者4-可选择的充分条件是图的染色理论中一个重要研究课题,本文研究了围长至少是4的特殊平面图的选择数,通过权转移的方法证明了每个围长至少是4且不合8-圈,9-圈和10-圈的平面图是3-可选择的.  相似文献   
2.
Let S(r) denote a circle of circumference r. The circular consecutive choosability chcc(G) of a graph G is the least real number t such that for any r≥χc(G), if each vertex v is assigned a closed interval L(v) of length t on S(r), then there is a circular r‐coloring f of G such that f(v)∈L(v). We investigate, for a graph, the relations between its circular consecutive choosability and choosability. It is proved that for any positive integer k, if a graph G is k‐choosable, then chcc(G)?k + 1 ? 1/k; moreover, the bound is sharp for k≥3. For k = 2, it is proved that if G is 2‐choosable then chcc(G)?2, while the equality holds if and only if G contains a cycle. In addition, we prove that there exist circular consecutive 2‐choosable graphs which are not 2‐choosable. In particular, it is shown that chcc(G) = 2 holds for all cycles and for K2, n with n≥2. On the other hand, we prove that chcc(G)>2 holds for many generalized theta graphs. © 2011 Wiley Periodicals, Inc. J Graph Theory 67: 178‐197, 2011  相似文献   
3.
Improper choosability of planar graphs has been widely studied. In particular, ?krekovski investigated the smallest integer gk such that every planar graph of girth at least gk is k‐improper 2‐choosable. He proved [9] that 6 ≤ g1 ≤ 9; 5 ≤ g2 ≤ 7; 5 ≤ g3 ≤ 6; and ? k ≥ 4, gk = 5. In this article, we study the greatest real M(k, l) such that every graph of maximum average degree less than M(k, l) is k‐improper l‐choosable. We prove that if l ≥ 2 then . As a corollary, we deduce that g1 ≤ 8 and g2 ≤ 6, and we obtain new results for graphs of higher genus. We also provide an upper bound for M(k, l). This implies that for any fixed l, . © 2006 Wiley Periodicals, Inc. J Graph Theory 52: 181–199, 2006  相似文献   
4.
A proper vertex coloring of a graph G = (V, E) is acyclic if G contains no bicolored cycle. Given a list assignment L = {L(v)|vV} of G, we say G is acyclically L‐list colorable if there exists a proper acyclic coloring π of G such that π(v)∈L(v) for all vV. If G is acyclically L‐list colorable for any list assignment with |L(v)|≥k for all vV, then G is acyclically k‐choosable. In this article we prove that every planar graph without 4‐cycles and without intersecting triangles is acyclically 5‐choosable. This improves the result in [M. Chen and W. Wang, Discrete Math 308 (2008), 6216–6225], which says that every planar graph without 4‐cycles and without two triangles at distance less than 3 is acyclically 5‐choosable. © 2011 Wiley Periodicals, Inc. J Graph Theory  相似文献   
5.
本文讨论了系列平行图的圆可选性.令x_(c,l)表示圆可选性(或圆列表着色数).本文证明了围长至少是4n 1的系列平行图的圆可选性至多为2 1/n.  相似文献   
6.
We prove a conjecture of Ohba that says that every graph G on at most vertices satisfies .  相似文献   
7.
构造了一个图G,给G的每个顶点v一个颜色列表,使得每个列表Lv的大小至少为每个顶点v的邻域NG(v)与每个Vc交集的最大数目,但是这个图不存在一个正常的列表染色,从而推翻了R eed的一个猜想.  相似文献   
8.
The slow-coloring game is played by Lister and Painter on a graph G. On each round, Lister marks a nonempty subset M of the uncolored vertices, scoring M points. Painter then gives a color to a subset of M that is independent in G. The game ends when all vertices are colored. Painter and Lister want to minimize and maximize the total score, respectively. The best score that each player can guarantee is the sum-color cost of G, written s?(G). The game is an online variant of online sum list coloring.We prove V(G)2α(G)+12s?(G)V(G)maxV(H)α(H):H?G, where α(G) is the independence number, and we study when equality holds in the bounds. We compute s?(G) for graphs with α(G)=2. Among n-vertex trees, we prove that s? is minimized by the star and maximized by the path. We also study s?(Kr,s).  相似文献   
9.
It is proved that the choice number of every graph G embedded on a surface of Euler genus ε ≥ 1 and ε ≠ 3 is at most the Heawood number and that the equality holds if and only if G contains the complete graph KH(ε) as a subgraph. © 1999 John Wiley & Sons, Inc. J Graph Theory 32: 327–339, 1999  相似文献   
10.
A proper vertex coloring of a graph G = (V,E) is acyclic if G contains no bicolored cycle. A graph G is L‐list colorable if for a given list assignment L = {L(v): vV}, there exists a proper coloring c of G such that c (v) ∈ L(v) for all vV. If G is L‐list colorable for every list assignment with |L (v)| ≥ k for all vV, then G is said k‐choosable. A graph is said to be acyclically k‐choosable if the obtained coloring is acyclic. In this paper, we study the links between acyclic k‐choosability of G and Mad(G) defined as the maximum average degree of the subgraphs of G and give some observations about the relationship between acyclic coloring, choosability, and acyclic choosability. © 2005 Wiley Periodicals, Inc. J Graph Theory 51: 281–300, 2006  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号