两类K_4同胚图的色唯一性

用k4(a ,b ,c ,d ,e,f)表示k4 同胚图 ,其中a ,b ,c ,d ,e,f分别表示度为 3的顶点间的道路的长 .本文主要研究了两类k4 同胚图的色唯一性 ,同时得到了几族新的不是色唯一的k4 同胚图     

某一类色唯一的K_4-同胚图

令K_4(i,j,k,l,m,n)表示两两三度点间的路长分别为i,j,k,l,m,n的K_4-同胚图.对6条路的长均大于1且有4条路的长相等其余两条路互不相等的K_4-同胚图的着色进行了研究,得到了一类色唯一的K_4-同胚图.     

6—桥图的色唯一性

由连接两个顶点的S条内部不交的路组成的图叫S-桥图。本文讨论了6-桥图F（a,b,c,d,e,f)(a≤6≤c≤d≤e≤f)的色性，给出了此类图色唯一的一个充分条件；并证明6-桥图F(2,2,2,a,b)（a≥b≥3)是色唯一的。     

研究K4-同胚图K4(α,1,1,δ,ε,η)色性的一个引理

主要介绍了一个引理，这个引理奠定了K4－同胚图K4（α，1，1，δ，ε，η）色性研究的基础。     

关于K4(2,3,3,δ,ε,η)色性问题的一个研究

证明：在K4-同胚图K4(2，3，3，δ，ε，η)图簇中，任何两个不同构的图都不是色等价的，这一结论从色多项式的角度刻划了K4同胚图K4(2，3，3，δ，ε，η)的结构特征，为进一步研究K4-同胚图的色唯一性奠定了基础。     

关于K4同胚图色唯一性的几个新结果

本文证得:如果i,j,k,l,m,n中有四个数相等,而另外二个数不小于此数,则K_4(i,j,k,l,m,n)是色唯一的.此外,我们还得到了另外两族具有色唯一性的K_4同胚图.     

一类K4—同胚图的色唯恶性循环

证明了：当γ＝β，β＋２，β＋３（β≥３＿时Ｋ４－同胚图Ｋ４（３，β，γ，１，１，１）是色唯一的。     

(v,e)-图的正常λ-着色的最大数目的新界(英文)

设P（G，λ）表示图G的色多项式．给定正整数n，e和λ,记f（v，e，λ）=max{P（G，λ）：G是个v点e边的图}．本文得到f（v，e，λ）的新上界和f（v，e，3）的新下界．     

一类K_4-同胚图的色唯一性

证明了：当γ＝β，β＋２，β＋３（β≥３）时Ｋ４－同胚图Ｋ４（３，β，γ，１，１，１）是色唯一的．     

具有较小直径的三类图的对极色数

对一个连通图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.     

Tree‐Chromatic Number Is Not Equal to Path‐Chromatic Number*

For a graph G and a tree‐decomposition of G, the chromatic number of is the maximum of , taken over all bags . The tree‐chromatic number of G is the minimum chromatic number of all tree‐decompositions of G. The path‐chromatic number of G is defined analogously. In this article, we introduce an operation that always increases the path‐chromatic number of a graph. As an easy corollary of our construction, we obtain an infinite family of graphs whose path‐chromatic number and tree‐chromatic number are different. This settles a question of Seymour (J Combin Theory Ser B 116 (2016), 229–237). Our results also imply that the path‐chromatic numbers of the Mycielski graphs are unbounded.     

List Edge‐Coloring and Total Coloring in Graphs of Low Treewidth

We prove that the list chromatic index of a graph of maximum degree Δ and treewidth is Δ; and that the total chromatic number of a graph of maximum degree Δ and treewidth is . This improves results by Meeks and Scott.     

On the circular chromatic number of circular partitionable graphs

This article studies the circular chromatic number of a class of circular partitionable graphs. We prove that an infinite family of circular partitionable graphs G has . A consequence of this result is that we obtain an infinite family of graphs G with the rare property that the deletion of each vertex decreases its circular chromatic number by exactly 1. © 2006 Wiley Periodicals, Inc. J Graph Theory     

Cycles with two blocks in k‐chromatic digraphs

Let k and ℓ be positive integers. A cycle with two blocks is a digraph obtained by an orientation of an undirected cycle, which consists of two internally (vertex) disjoint paths of lengths at least k and ℓ, respectively, from a vertex to another one. A problem of Addario‐Berry, Havet and Thomassé [J. Combin. Theory Ser. B 97 (2007), 620–626] asked if, given positive integers k and ℓ such that , any strongly connected digraph D containing no has chromatic number at most . In this article, we show that such digraph D has chromatic number at most , improving the previous upper bound of Cohen et al. [Subdivisions of oriented cycles in digraphs with large chromatic number, to appear]. We also show that if in addition D is Hamiltonian, then its underlying simple graph is ‐degenerate and thus the chromatic number of D is at most , which is tight.     

Circular coloring of signed graphs

Let ( be two positive integers. We generalize the well‐studied notions of ‐colorings and of the circular chromatic number to signed graphs. This implies a new notion of colorings of signed graphs, and the corresponding chromatic number χ. Some basic facts on circular colorings of signed graphs and on the circular chromatic number are proved, and differences to the results on unsigned graphs are analyzed. In particular, we show that the difference between the circular chromatic number and the chromatic number of a signed graph is at most 1. Indeed, there are signed graphs where the difference is 1. On the other hand, for a signed graph on n vertices, if the difference is smaller than 1, then there exists , such that the difference is at most . We also show that the notion of ‐colorings is equivalent to r‐colorings (see [12] (X. Zhu, Recent developments in circular coloring of graphs, in Topics in Discrete Mathematics Algorithms and Combinatorics Volume 26 , Springer Berlin Heidelberg, 2006, pp. 497–550)).     

Counterexamples to the List Square Coloring Conjecture

The square G² of a graph G is the graph defined on such that two vertices u and v are adjacent in G² if the distance between u and v in G is at most 2. Let and be the chromatic number and the list chromatic number of a graph H, respectively. A graph H is called chromatic‐choosable if . It is an interesting problem to find graphs that are chromatic‐choosable. Kostochka and Woodall (Choosability conjectures and multicircuits, Discrete Math., 240 (2001), 123–143) conjectured that for every graph G, which is called List Square Coloring Conjecture. In this article, we give infinitely many counter examples to the conjecture. Moreover, we show that the value can be arbitrarily large.     

Nonrepetitive colorings of graphs excluding a fixed immersion or topological minor

We prove that graphs excluding a fixed immersion have bounded nonrepetitive chromatic number. More generally, we prove that if is a fixed planar graph that has a planar embedding with all the vertices with degree at least 4 on a single face, then graphs excluding as a topological minor have bounded nonrepetitive chromatic number. This is the largest class of graphs known to have bounded nonrepetitive chromatic number.     

Clique minors in double‐critical graphs

A connected t‐chromatic graph G is double‐critical if is ‐colorable for each edge . A long‐standing conjecture of Erdős and Lovász that the complete graphs are the only double‐critical t‐chromatic graphs remains open for all . Given the difficulty in settling Erdős and Lovász's conjecture and motivated by the well‐known Hadwiger's conjecture, Kawarabayashi, Pedersen, and Toft proposed a weaker conjecture that every double‐critical t‐chromatic graph contains a minor and verified their conjecture for . Albar and Gonçalves recently proved that every double‐critical 8‐chromatic graph contains a K₈ minor, and their proof is computer assisted. In this article, we prove that every double‐critical t‐chromatic graph contains a minor for all . Our proof for is shorter and computer free.