Neighbor Sum Distinguishing Total Colorings of Triangle Free Planar Graphs
|
|
- Lambert Francis
- 6 years ago
- Views:
Transcription
1 Acta Mathematica Sinica, English Series Feb., 2015, Vol. 31, No. 2, pp Published online: January 15, 2015 DOI: /s y Acta Mathematica Sinica, English Series Springer-Verlag Berlin Heidelberg & The Editorial Office of AMS 2015 Neighbor Sum Distinguishing Total Colorings of Triangle Free Planar Graphs Ji Hui WANG Qiao Ling MA Xue HAN School of Mathematical Sciences, University of Ji nan, Ji nan , P. R. China wangjh@ujn.edu.cn ss maql@ujn.edu.cn ss hanx@ujn.edu.cn Abstract A total k-coloring c of a graph G is a proper total coloring c of G using colors of the set [k] ={1, 2,...,k}. Let f(u) denote the sum of the color on a vertex u and colors on all the edges incident to u. Ak-neighbor sum distinguishing total coloring of G is a total k-coloring of G such that for each edge uv E(G), f(u) f(v). By χ nsd(g), we denote the smallest value k in such a coloring of G. Pilśniak and Woźniak conjectured that χ nsd(g) Δ(G) + 3 for any simple graph with maximum degree Δ(G). In this paper, by using the famous Combinatorial Nullstellensatz, we prove that the conjecture holds for any triangle free planar graph with maximum degree at least 7. Keywords Neighbor sum distinguishing total coloring, combinatorial Nullstellensatz, triangle free planar graph MR(2010) Subject Classification 05C15 1 Introduction The terminology and notation used but undefined in this paper can be found in [2]. Graphs considered in this paper are finite, simple and undirected. Let G =(V,E) be a graph. We use V (G), E(G), Δ(G) andδ(g) to denote the vertex set, edge set, maximum degree and minimum degree of G, respectively. Let d G (v) orsimplyd(v) denote the degree of a vertex v in G. Given a graph G =(V,E) and a positive integer k, a total k-coloring of G is a mapping φ : V E {1, 2,...,k} such that (a) φ(u) φ(v) for every pair u, v of adjacent vertices; (b) φ(v) φ(e) for every vertex v and every edge e incident to v; (c) φ(e) φ(e ) for every pair e, e of adjacent edges. Given a total k-coloring φ of G, letc φ (v) denote the set of colors of the edges incident to v and the color of v. A total k-coloring is called adjacent vertex distinguishing if for each edge uv, C φ (u) is different from C φ (v). The smallest k admitting such coloring is called the adjacent vertex distinguishing total chromatic number, denoted by χ nd (G). Zhang [23] put forward the following conjecture. Conjecture 1.1 ([23]) For any graph G with at least two vertices, χ nd (G) Δ(G)+3. Received February 21, 2014, accepted July 2, 2014 Supported by National Natural Science Foundation of China (Grant No ) and the Scientific Research Foundation of University of Ji nan (Grant No. XKY1120)
2 Neighbor Sum Distinguishing Total Colorings of Triangle Free Planar Graphs 217 Conjecture 1.1 has been confirmed for subcubic graphs, K 4 -minor free graphs and planar graphs with large maximum degree, see [3, 7, 18, 19]. Recently, colorings and labellings related to sums of the colors have received much attention. The family of such problems includes, e.g., vertex-coloring k-edge-weightings [20], total weight choosability [16, 21], magic and antimagic labellings [8, 22] and the irregulaity strength [13, 14]. Among them there are the Conjecture due to Karoński et al. [9] and 1-2 Conjecture due to Przyby lo and Woźniak [15]. For more information, see the survey paper [17]. In a total k-coloring of G, letf(v) denote the total sum of colors of the edges incident to v and of v itself. If for each edge uv, f(u) f(v), we call such total k-coloring a k-neighbor sum distinguishing total coloring. The smallest number k admitting such coloring is called the neighbor sum distinguishing total chromatic number, denoted by χ nsd (G). For neighbor sum distinguishing total colorings, we have the following conjecture due to Pilśniak and Woźniak [12]. Conjecture 1.2 ([12]) For any graph G with at least two vertices, χ nsd (G) Δ(G)+3. Clearly, Conjecture 1.2 implies Conjecture 1.1 since it is easy to check that χ nd (G) χ nsd (G). Pilśniak and Woźniak [12] proved that Conjecture 1.2 holds for complete graphs, cycles, bipartite graphs and subcubic graphs. Dong and Wang [6] showed that Conjecture 1.2 holds for sparse graphs. Li et al. [11] confirmed this conjecture for K 4 -minor free graphs. By using the famous Combinatorial Nullstellensatz, Ding et al. [4] proved that χ nsd (G) 2Δ(G)+col(G) 1, where col(g) is the coloring number of G. Later Ding et al. [5] improved this bound to Δ(G)+2col(G) 2. Moreover they proved this assertion in its list version. In [10], Li et al. proved that Conjecture 1.2 holds for planar graphs with maximum degree at least 13. In this paper, we prove that Conjecture 1.2 holds for triangle free planar graphs with maximum degree at least 7. We have the following result. Theorem 1.3 Let G be a triangle free planar graphs with maximum degree Δ(G) 7. Then χ nsd (G) Δ(G)+3. 2 Preliminaries To prove our main result, we need to introduce some notations. A vertex v is called an l-vertex if d(v) =l, similarly, we call it an l + -vertex or an l -vertex if d(v) l or d(v) l. Suppose that H is a subgraph of a given planar graph G. Forx V (H), let d H (x) denote the degree of x in H. WeuseNl H(x) todenotethesetofl-vertices adjacent to x in H and set dh l (x) = N l H(x). Similarly, we can define d H l (x) andd H + l (x). If there is no confusion in the context, we usually write d G l (x), dg l (x), d G + l (x) asd l (x), d l +(x), d l (x), respectively. In order to prove the main result, we need some lemmas. The famous Combinatorial Nullstellensatz [1] presented below will be used frequently in our proofs. Lemma 2.1 ([1]) Let F be an arbitrary field, and let P = P (x 1,...,x n ) be a polynomial in F[x 1,...,x n ].Supposethedegreedeg(P ) of P equals n k i,whereeachk i is a non-negative k1 k integer, and suppose the coefficient of x 1 x n n in P is non-zero. Then if S 1,...,S n are subsets of F with S i >k i, there are s 1 S 1,...,s n S n so that P (s 1,...,s n ) 0. Lemma 2.2 ([10]) Suppose S is a set of integers and S = n. LetT = { m x i x i S, x i x j (i j)}, wherem n. Then T mn m 2 +1.
3 218 Wang J. H., et al. 3 Proof of Theorem Unavoidable Configuration Let k = Δ(G) + 3. For simplicity, we use k-nsd-total coloring to denote k-neighbor sum distinguishing total coloring. Suppose that φ is a k-nsd-total coloring of triangle free planar graph G with Δ(G) 7. Assume that v V (G) withd(v) 3. It is easy to see that v has at most 3 adjacent vertices and 3 incident edges, so v has at most 9 forbidden colors. Since k 10, we may erase the color of v and recolor it at the end. In other words, we will omit the coloring for all 3 -vertices in the following discussion. Our proof proceeds by reduction and absurdum. Assume that G is a counterexample to Theorem 1.3 such that V (G) + E(G) is as small as possible. Obviously, G is connected. In the following, we give some properties of G. Claim 1 There is no edge uv E(G) such that d(u) 4andd(v) 3. Proof It is enough to show that there is no 4-vertex adjacent to any 3 -vertex. Suppose to the contrary that G contains a vertex u of degree 4 which is adjacent to a 3 -vertex v. Let H = G uv. By the minimality of G, thereisak-nsd-total coloring φ of H. We shall now extend the coloring φ to G. Since d(v) 3, we can erase the color of v and recolor it at the end. Assume that N(u) ={v, u 1,u 2,u 3 }. Now, we erase the color of u, and color the edge uv and the vertex u with x 1 and x 2 (x 1,x 2 [k]), respectively. To guarantee that the coloring is a nsd-total coloring, we can color the edge uv with colors which are different from the colors of the edges incident with u and v. Let S 1 denote the feasible color set which uv canuse. Thenwehave S 1 Δ Similarly, we cannot use the colors of uu i and u i (i =1, 2, 3) to color the vertex u. Hence, let S 2 denote the feasible color set which u can be used. Then S 2 Δ Let w i denote the total sum of colors assigned to u i and these edges incident to u i in H for i =1, 2, 3, and let w 0 denote the contemporary sum at u (not counting the color of uv and u). In order to guarantee the sum obtained at u must be distinct from the other already fixed sums of the neighbors of u. It is then enough to find appropriate substitutions for the variables x 1 and x 2 such that the value of the following polynomial is non-zero: P (x 1,x 2 )=(x 1 x 2 )(x 1 + x 2 + w 0 w 1 )(x 1 + x 2 + w 0 w 2 )(x 1 + x 2 + w 0 w 3 ). Since deg(p ) = 4, by Lemma 2.1, it is enough to show that the coefficient of the monomial x 3 1 x 2 in P is non-zero. However, this coefficient is the same as the coefficient of the same monomial in Q(x 1,x 2 )=(x 1 x 2 )(x 1 + x 2 ) 3. Since = 12, then we know that the 4 Q x 13 x 2 coefficient of the monomial x 3 1 x 2 in P is 2. Since S 1 5 > 3, S 2 4 > 1, by Combinatorial Nullstellensatz, we can find s 1 S 1 and s 2 S 2 such that P (s 1,s 2 ) 0. Thus we know that G has a k-nsd-total coloring, a contradiction. Claim 2 If u is a 5-vertex of G, thend 1 (u) =d 2 (u) =0andd 3 (u) 1. Proof First, we prove that d 1 (u) =d 2 (u) =0. Suppose to the contrary that G contains a vertex u of degree 5 which is adjacent to a 2 - vertex v. LetH = G uv. ThenH has a k-nsd-total coloring. Let N(u) ={v, u 1,u 2,u 3,u 4 }. Similarly to the proof of Claim 1, we erase the color of u, and use colors x 1,x 2 to color the
4 Neighbor Sum Distinguishing Total Colorings of Triangle Free Planar Graphs 219 edge uv and the vertex u, respectively. Let w i denote the total sum of colors assigned to u i and those edges incident to u i in H for i =1, 2, 3, 4, and let w 0 denote the contemporary sum at u (not counting the color of uv and u). Then we let P (x 1,x 2 )=(x 1 x 2 )(x 1 +x 2 +w 0 w 1 )(x 1 +x 2 +w 0 w 2 )(x 1 +x 2 +w 0 w 3 )(x 1 +x 2 +w 0 w 4 ). Obviously, deg(p )=5. LetQ(x 1,x 2 )=(x 1 x 2 )(x 1 + x 2 ) 4.Then 5 Q x 14 x 2 = 72, and we know that the coefficient of the monomial x 1 4 x 2 in Q is 3. This coefficient is the same as the coefficient of the same monomial in P (x 1,x 2 ). Let S i denote the feasible color set which x i can be used for i =1, 2. Since d(v) 2, then we know that S 1 Δ > 4, S 2 Δ > 1. By Lemma 2.1, we can find s 1 S 1 and s 2 S 2 such that P (s 1,s 2 ) 0. Thus we know that G has a k-nsd-total coloring, a contradiction. Now, we prove that d 3 (u) 1. Suppose to the contrary that G contains a vertex u of degree 5 which is adjacent to two 3-vertexs v 1,v 2. Let N(u) ={v 1,v 2,u 1,u 2,u 3 } and let H = G uv 1 uv 2. Then H has a k-nsd-total coloring. Similarly, we erase the color of u, and use colors x 1,x 2,x 3 to color the edges uv 1,uv 2 and vertex u, respectively. Let w i denote the total sum of colors assigned to u i and the edges incident to u i in H for i =1, 2, 3, and let w 0 denote the contemporary sum at u (not counting the colors of uv 1,uv 2 and u). Let P (x 1,x 2,x 3 )= 3 ( 3 ) (x i x j ) x j + w 0 w i and 1 i<j 3 Q(x 1,x 2,x 3 )= 1 i<j 3 j=1 ( 3 ) 3 (x i x j ) x i. Since 6 Q x 3 1 x 2 2 x 3 = 12, then we know that the coefficient of the monomial x 3 1 x 2 2 x 3 in P (x 1,x 2,x 3 )is1. LetS i denote the feasible color set which x i can be used for i =1, 2, 3. Since d(v 1 )=d(v 2 )=3,then S 1 = S 2 Δ+3 5 5, S 3 Δ By Lemma 2.1, we can find s 1 S 1, s 2 S 2 and s 3 S 3 such that P (s 1,s 2,s 3 ) 0. ThenG has a k-nsd-total coloring, a contradiction. Claim 3 Let u be a 6-vertex of G. Thend 2 (u) 1andifd 2 (u) =1,thend 3 (u) =0. Proof In order to prove the claim, we may only to prove that u cannot be adjacent to a 2 -vertex and a 3 -vertex. Suppose to the contrary that G contains a vertex u of degree 6 which is adjacent to a 2 - vertex v 1 and a 3 -vertex v 2. Let N(u) ={v 1,v 2,u 1,u 2,u 3,u 4 } and let H = G uv 1 uv 2. Then H has a k-nsd-total coloring. Similarly, we erase the colors of u, v 1,v 2, and use colors x 1,x 2,x 3 to color the edges uv 1,uv 2 and vertex u, respectively. Let w i denote the total sum of colors assigned to u i and those edges incident to u i in H for i =1, 2, 3, 4, and let w 0 denote the contemporary sum at u (not counting the colors of uv 1,uv 2 and u). Let P (x 1,x 2,x 3 )= 4 ( 3 ) (x i x j ) x j + w 0 w i 1 i<j 3 j=1
5 220 Wang J. H., et al. and Q(x 1,x 2,x 3 )= 1 i<j 3 ( 3 ) 4 (x i x j ) x i. Since 7 Q x 4 1 x 2 2 x 3 = 144, then we know that the coefficient of the monomial x 4 1 x 2 2 x 3 in P (x 1,x 2,x 3 )is3. LetS i denote the feasible color set which x i can be used for i =1, 2, 3. Since d(v 1 ) 2, d(v 2 ) 3, then S 1 Δ > 4, S 2 Δ > 2, S 3 Δ > 1. By Lemma 2.1, we can find s 1 S 1, s 2 S 2 and s 3 S 3 such that P (s 1,s 2,s 3 ) 0. ThenG has a k-nsd-total coloring, a contradiction. Claim 4 Let u be a 7-vertex of G. Thend 2 (u) 2and (1) If d 2 (u) =1,thend 3 (u) 1. (2) If d 2 (u) =2,thend 3 (u) =0. Proof In order to prove the claim, we may only to prove that u cannot be adjacent to a 2 -vertex and two 3 -vertexs. Suppose to the contrary that G contains a vertex u of degree 7 which is adjacent to a 2 -vertex v 1 and two 3 -vertexs v 2,v 3. Let N(u) ={v 1,v 2,v 3,u 1,u 2,u 3,u 4 } and let H = G uv 1 uv 2 uv 3. Then H has a k-nsd-total coloring. Similarly, we erase the colors of u, v 1,v 2,v 3, and use colors x 1,x 2,x 3,x 4 to color the edges uv 1,uv 2,uv 3 and the vertex u, respectively. Let w i denote the total sum of colors assigned to u i and those edges incident to u i in H for i =1, 2, 3, 4, and let w 0 denote the contemporary sum at u (not counting the color of uv 1,uv 2,uv 3 and u). Let P (x 1,x 2,x 3,x 4 )= 4 ( 4 ) (x i x j ) x j + w 0 w i 1 i<j 4 j=1 and Q(x 1,x 2,x 3,x 4 )= 1 i<j 4 ( 4 ) 4 (x i x j ) x i. Since 10 Q x 4 1 x 3 2 x 2 3 x 4 = 288, then we know that the coefficient of the monomial x 4 1 x 3 2 x 2 3 x 4 in P (x 1,x 2,x 3,x 4 )is1.lets i denote the feasible color set which x i canbeusedfori =1, 2, 3, 4. Since d(v 1 ) 2, d(v 2 ) d(v 3 ) 3, then S 1 Δ > 4, S 2 Δ > 3, S 3 Δ > 2, S 4 Δ > 1. By Lemma 2.1, we can find s 1 S 1, s 2 S 2, s 3 S 3 and s 4 S 4 such that P (s 1,s 2,s 3,s 4 ) 0. ThenG has a k-nsd-total coloring, a contradiction. Claim 5 Let u be an l-vertex of G with l 8. If d 2 (u) 0,thend 3 (u) l 2. Proof Let t = d 3 (u), s = l 2. Suppose to the contrary that t>s,letu 1,u 2,...,u l be the neighbors of u with d(u 1 ) d(u 2 ) d(u l ), and d(u 1 ) 2. Without loss of generality, we may assume that d(u 1 ) = 2, and d(u 2 )=d(u 3 )= = d(u t )=3. LetH = G uu 1.ThenH has a total k-nsd-coloring φ. We erase all the colors of u i and uu i for 1 i t and denote this coloring by φ.letc = {1, 2,...,k}, C φ (v) denote the set of colors assigned to a vertex v and those edges incident to v in H and φ(uv) denote the color that assigned to a edge uv in H.
6 Neighbor Sum Distinguishing Total Colorings of Triangle Free Planar Graphs 221 First suppose that there exists an integer i, 2 i t, such that φ(u 1 v 1 ) C φ (u i ), without loss of generality, we may assume that φ(u 1 v 1 ) C φ (u 2 ). Since Δ d(u) = l, C\(C φ (u) {φ(u 1 v 1 )}) Δ+3 (l t +2) t +1. Thus we can choose t colors from C\(C φ (u) {φ(u 1 v 1 )}) (at least different t + 1 colors) to color uu 1,...,uu t. Since t>s, by Lemma 2.2, we can find at least t +1 different ways to color uu 1,...,uu t which result in at least t + 1 different sums of the vertex u. Hence, we can find at least one color set C C\(C φ (u) {φ(u 1 v 1 )}) to color uu 1,...,uu t, such that the sums of u does not conflict with its neighbors. In the following we will give a k-nsd-coloring φ of G, which will yield a contradiction. We color uu t,...,uu 1 one-by-one with colors in C as follows: Since d(u i )=3 for 2 i t, we color uu i with color a i in (C \{a t,...,a i+1 })\C φ (u i ). Since d(u 2 )=3, φ(u 1 v 1 ) / C, but φ(u 1 v 1 ) C φ (u 2 ), we color uu 2 with color a 2 in (C \{a t,...,a 3 })\C φ (u 2 ). Since d(u 1 )=2andφ(u 1 v 1 ) / C, we color uu 1 with color in C \{a t,...,a 2 }. Now we can assume that for every integer i, 2 i t, φ(u 1 v 1 ) / C φ (u i ). Without loss of generality, let a C φ (u 2 ). Since Δ d(u) =l, C\(C φ (u) {a}) Δ+3 (l +2 t) t +1. Thus we can choose t colors from at least t + 1 colors to color uu 1,...,uu t. Since t>s,by Lemma 2.2, we can find at least t +1 different ways to color uu 1,...,uu t,whichgett +1 different sums of vertex u. Hence, we can find one color set C C\(C φ (u) {a}) to color uu 1,...,uu t, such that f(u) does not conflict with its conflicting vertices. In the following, we will properly color uu 1,...,uu t with colors in C to get a total k-nsd-coloring φ of G, which is a contradiction. Case 1 φ(u 1 v 1 ) / C. Since d(u i )=3for3 i t, we color uu i with color a i in (C \{a t,...,a i+1 })\C φ (u i ). Since d(u 2 )=3,a / C and a C φ (u 2 ), we color uu 2 with color a 2 (C \{a t,...,a 3 })\C φ (u 2 ). Since d(u 1 )=2andφ(u 1 v 1 ) / C, we color uu 1 with color in C \{a t,...,a 2 }. We get a total k-nsd-coloring of G. Case 2 φ(u 1 v 1 ) C. We use φ(u 1 v 1 )=a t to color uu t.sinced(u i )=3for3 i t 1, we color uu i with color a i in (C \{a t,...,a i+1 })\C φ (u i ). Since d(u 2 )=3, a / C and a C φ (u 2 ), we choose one color a 2 in (C \{a t,...,a 3 })\C φ (u 2 ) to color uu 2.Sinced(u 1 )=2andφ(u 1 v 1 )=a t, we color uu 1 with color in C \{a t,...,a 2 }. Then we get a total k-nsd-coloring of G. 3.2 Discharging Process Let H be the graph obtained by removing all leaves of G. Then H is a connected planar graph with δ(h) 2. By Claims 1 5, we display the relation between d(v) andd H (v) in Table 1. d(v) d H (v) = d(v) Table 1 The relation between d(v) andd H (v) Claim 6 Let v be a vertex of H. Ifd H (v) =2ord H (v) = 3, then the neighbors of v must be 5 + -vertices in H.
7 222 Wang J. H., et al. Proof If there is a vertex u with d(u) =8andd H (u) = 4. By Claim 5, u must have 4 leaves in G and have no neighbor of 2-vertex and 3-vertex. If d(u) 8, it is trivial by Table 1 and Claim 1. Using Euler s formula V (H) E(H) + F (H) =2, we have (d H (v) 4) + (d H (f) 4) = 8. v V (H) f F (H) In order to complete the proof, we use the discharging method. First, we give an initial charge function w(v) = d H (v) 4 for every v V (H) andw(f) = d H (f) 4 for every f F (H). Next, we design a discharging rule and redistribute weights accordingly. Let w be the new charge after the discharging. We will show that w (x) 0 for all x V (H) F (H). This leads to the following obvious contradiction: 0 w (x) = w(x) = 8 < 0, x V (H) F (H) x V (H) F (H) hence demonstrates that no such a counterexample can exist. The discharging rules are defined as follows: (R) For every 5 + -vertex u, it gives 1 to each adjacent 2-vertex and gives 1 3 to each adjacent 3-vertex. By the rule (R), we have the following results: 1. For every 5-vertex u in G, by Claim 2, d H (u) =5andu has at most one neighbor of 3-vertex in H. Sow (u) > For every 6-vertex u in G, by Claim 3, d 2 (u) 1, and we have (1) If d 2 (u) =0,thend H (u) = 6, and the neighbors of u must be all 3 + -vertex in H. So w (u) =0. (2) If d 1 (u) =1,thend 2 (u) =d 3 (u) =0. Thend H (u) =5andtheneighborofu must be all 4 + -vertex in H. Sow (u) =5 4 > 0. (3) If d 2 (u) =1,thend 1 (u) =d 3 (u) =0. Thend H (u) =6andw (u) =6 4 1 > For every 7-vertex u in G, by Claim 4, d 2 (u) 2 and we have (1) If d 2 (u) =0,thend H (u) = 7, and the neighbor of u must be all 3 + -vertex in H. So w (u) > 0. (2) If d 1 (u) =1,thend 2 (u) =0,d 3 (u) 1. Then d H (u) =6andw (u) > 0. (3) If d 1 (u) =0,thend 2 (u) =1,d 3 (u) 1. Then d H (u) =7andw (u) > 0. (4) If d 1 (u) =2,thend 2 (u) =0,d 3 (u) =0. Thend H (u) =5andw (u) =5 4 > 0. (5) If d 1 (u) =0,thend 2 (u) =2,d 3 (u) =0. Thend H (u) =7andw (u) =7 4 2 > 0. (6) If d 1 (u) =1,thend 2 (u) =1,d 3 (u) =0. Thend H (u) =6andw (u) =6 4 1 > For every l-vertex(l 8) u in G, by Claim 5, we have (1) If d 2 (u) =0,thend H (u) =l, and the neighbors of u must be all 3 + -vertex in H. Since l 8, we have w (u) l l>0. (2) If d 2 (u) 0,thend 3 (u) l 2.Letd 1(u) =x, d 2 (u) =y. Thend 3 (u) l 2 x y.
8 Neighbor Sum Distinguishing Total Colorings of Triangle Free Planar Graphs 223 So w (u) l 4 x y ( ) l 1 x y 2 3 l ( ) l x y For every 2-vertex or 3-vertex u in H, by Claim 6, we have w (u) =2 4+2=0 or w (u) = =0. 6. For every face f in H, sinceh is also a triangle free planar graph, then d(f) 4, and we have w (f) =w(f) 0. From the above discussion, we have w (x) > 0. x V (H) F (H) That is a contradiction. Acknowledgements We would like to thank the referees for their various comments and suggestions. References [1] Alon, N.: Combinatorial Nullstellensatz. Combin. Probab. Comput., 8, 7 29 (1999) [2] Bondy, J. A., Murty, U. S. R.: Graph Theory with Applications, North-Holland, New York, 1976 [3] Chen, X.: On the adjacent vertex distinguishing total coloring numbers of graphs with Δ = 3. Discrete Math., 308(17), (2008) [4] Ding, L., Wang, G., Yan, G.: Neighbor sum distinguishing total colorings via the Combinatorial Nullstellensatz. Sci. China Ser. A, 57(9), (2014) [5] Ding, L., Wang, G., Wu, J., Yu, J.: Neighbor sum (set) distinguishing total choosability via the Combinatorial Nullstellensatz, submitted [6] Dong, A., Wang, G.: Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree. Acta Math. Sin., Engl. Series, 30(4), (2014) [7] Huang, D., Wang, W.: Adjacent vertex distinguishing total coloring of planar graphs with large maximum degree (in Chinese). Sci. Sin. Math., 42(2), (2012) [8] Huang, P., Wong, T., Zhu, X.: Weighted-1-antimagic graphs of prime power order. Discrete Math., 312(14), (2012) [9] Karoński, M., Luczak, T., Thomason, A.: Edge weights and vertex colours. J. Combin. Theory Ser. B, 91(1), (2004) [10] Li, H., Ding, L., Liu, B., et al.: Neighbor sum distinguishing total colorings of planar graphs. J. Comb. Optim., DOI: /s [11] Li, H., Liu, B., Wang, G.: Neighor sum distinguishing total colorings of K 4 -minor free graphs. Front. Math. China, 8(6), (2013) [12] Pilśniak, M., Woźniak, M.: On the total-neighbor-distinguishing index by sums. Graph and Combin., DOI /s [13] Przyby lo, J.: Irregularity strength of regular graphs. Electron. J. Combin., 15(1), #R82, 10pp (2008) [14] Przyby lo, J.: Linear bound on the irregularity strength and the total vertex irregularity strength of graphs. SIAM J. Discrete Math., 23(1), (2009) [15] Przyby lo, J., Woźniak, M.: On a 1, 2 conjecture. Discrete Math. Theor. Comput. Sci., 12(1), (2010) [16] Przyby lo, J., Woźniak, M.: Total weight choosability of graphs. Electron.J.Combin., 18, #P112, 11pp (2011) [17] Seamone, B.: The conjecture and related problems: a survey, arxiv: [18] Wang, W., Huang, D.: The adjacent vertex distinguishing total coloring of planar graphs. J. Comb. Optim., DOI /s [19] Wang, W., Wang, P.: On adjacent-vertex- distinguishing total coloring of K 4 -minor free graphs. Sci. China, Ser. A, 39(12), (2009)
9 224 Wang J. H., et al. [20] Kalkowski, M., Karoński, M., Pfender, F.: Vertex-coloring edge-weightings: towards the conjecture. J. Combin. Theory Ser. B, 100, (2010) [21] Wong, T., Zhu, X.: Total weight choosability of graphs. J. Graph Theory, 66, (2011) [22] Wong, T., Zhu, X.: Antimagic labelling of vertex weighted graphs. J. Graph Theory, 3(70), (2012) [23] Zhang, Z., Chen, X., Li, J., et al.: On adjacent-vertex-distinguishing total coloring of graphs. Sci. China, Ser. A, 48(3), (2005)
Equitable list colorings of planar graphs without short cycles
Theoretical Computer Science 407 (008) 1 8 Contents lists available at ScienceDirect Theoretical Computer Science journal homepage: www.elsevier.com/locate/tcs Equitable list colorings of planar graphs
More informationVertex-Coloring Edge-Weighting of Bipartite Graphs with Two Edge Weights
Discrete Mathematics and Theoretical Computer Science DMTCS vol. 17:3, 2015, 1 12 Vertex-Coloring Edge-Weighting of Bipartite Graphs with Two Edge Weights Hongliang Lu School of Mathematics and Statistics,
More informationADJACENT VERTEX DISTINGUISHING TOTAL COLORING OF GRAPHS WITH LOWER AVERAGE DEGREE. Weifan Wang and Yiqiao Wang
TAIWANESE JOURNAL OF MATHEMATICS Vol. 12, No. 4, pp. 979-990, July 2008 This paper is available online at http://www.tjm.nsysu.edu.tw/ ADJACENT VERTEX DISTINGUISHING TOTAL COLORING OF GRAPHS WITH LOWER
More informationarxiv: v2 [math.co] 6 Sep 2016
Acyclic chromatic index of triangle-free -planar graphs Jijuan Chen Tao Wang Huiqin Zhang Institute of Applied Mathematics Henan University, Kaifeng, 475004, P. R. China arxiv:504.06234v2 [math.co] 6 Sep
More informationOn uniquely 3-colorable plane graphs without prescribed adjacent faces 1
arxiv:509.005v [math.co] 0 Sep 05 On uniquely -colorable plane graphs without prescribed adjacent faces Ze-peng LI School of Electronics Engineering and Computer Science Key Laboratory of High Confidence
More informationFractional and circular 1-defective colorings of outerplanar graphs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 6() (05), Pages Fractional and circular -defective colorings of outerplanar graphs Zuzana Farkasová Roman Soták Institute of Mathematics Faculty of Science,
More informationOn decomposing graphs of large minimum degree into locally irregular subgraphs
On decomposing graphs of large minimum degree into locally irregular subgraphs Jakub Przyby lo AGH University of Science and Technology al. A. Mickiewicza 0 0-059 Krakow, Poland jakubprz@agh.edu.pl Submitted:
More informationOn Adjacent Vertex-distinguishing Total Chromatic Number of Generalized Mycielski Graphs. Enqiang Zhu*, Chanjuan Liu and Jin Xu
TAIWANESE JOURNAL OF MATHEMATICS Vol. xx, No. x, pp. 4, xx 20xx DOI: 0.650/tjm/6499 This paper is available online at http://journal.tms.org.tw On Adjacent Vertex-distinguishing Total Chromatic Number
More informationEQUITABLE COLORING OF SPARSE PLANAR GRAPHS
EQUITABLE COLORING OF SPARSE PLANAR GRAPHS RONG LUO, D. CHRISTOPHER STEPHENS, AND GEXIN YU Abstract. A proper vertex coloring of a graph G is equitable if the sizes of color classes differ by at most one.
More informationarxiv: v1 [math.co] 25 Dec 2017
Planar graphs without -cycles adjacent to triangles are DP--colorable Seog-Jin Kim and Xiaowei Yu arxiv:1712.08999v1 [math.co] 25 Dec 2017 December 27, 2017 Abstract DP-coloring (also known as correspondence
More informationarxiv: v1 [math.co] 11 Apr 2018
Every planar graph without adjacent cycles of length at most 8 is 3-choosable arxiv:1804.03976v1 [math.co] 11 Apr 2018 Runrun Liu and Xiangwen Li Department of Mathematics & Statistics Central China Normal
More informationGRAPH CHOOSABILITY AND DOUBLE LIST COLORABILITY. Hamid-Reza Fanaï
Opuscula Mathematica Vol. 30 No. 3 2010 http://dx.doi.org/10.7494/opmath.2010.30.3.271 GRAPH CHOOSABILITY AND DOUBLE LIST COLORABILITY Hamid-Reza Fanaï Abstract. In this paper, we give a sufficient condition
More informationHanna Furmańczyk EQUITABLE COLORING OF GRAPH PRODUCTS
Opuscula Mathematica Vol. 6 No. 006 Hanna Furmańczyk EQUITABLE COLORING OF GRAPH PRODUCTS Abstract. A graph is equitably k-colorable if its vertices can be partitioned into k independent sets in such a
More informationDiscrete Mathematics. The average degree of a multigraph critical with respect to edge or total choosability
Discrete Mathematics 310 (010 1167 1171 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: www.elsevier.com/locate/disc The average degree of a multigraph critical with respect
More informationAN ORIENTED VERSION OF THE CONJECTURE
Discussiones Mathematicae Graph Theory 35 (2015) 141 156 doi:10.7151/dmgt.1791 AN ORIENTED VERSION OF THE 1-2-3 CONJECTURE Olivier Baudon, Julien Bensmail and Éric Sopena Univ. Bordeaux, LaBRI, UMR 5800,
More informationSmall Cycle Cover of 2-Connected Cubic Graphs
. Small Cycle Cover of 2-Connected Cubic Graphs Hong-Jian Lai and Xiangwen Li 1 Department of Mathematics West Virginia University, Morgantown WV 26505 Abstract Every 2-connected simple cubic graph of
More informationMinimum degree conditions for the existence of fractional factors in planar graphs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 72(3) (2018), Pages 536 548 Minimum degree conditions for the existence of fractional factors in planar graphs P. Katerinis Department of Informatics, Athens
More informationarxiv: v1 [math.co] 7 Nov 2018
DP-4-COLORABILITY OF TWO CLASSES OF PLANAR GRAPHS LILY CHEN 1 AND RUNRUN LIU 2 AND GEXIN YU 2, AND REN ZHAO 1 AND XIANGQIAN ZHOU 1,4 arxiv:1811.02920v1 [math.co] Nov 2018 1 School of Mathematical Sciences,
More informationConditional colorings of graphs
Discrete Mathematics 306 (2006) 1997 2004 Note Conditional colorings of graphs www.elsevier.com/locate/disc Hong-Jian Lai a,d, Jianliang Lin b, Bruce Montgomery a, Taozhi Shui b, Suohai Fan c a Department
More informationA Sufficient condition for DP-4-colorability
A Sufficient condition for DP-4-colorability Seog-Jin Kim and Kenta Ozeki August 21, 2017 Abstract DP-coloring of a simple graph is a generalization of list coloring, and also a generalization of signed
More informationAverage degrees of edge-chromatic critical graphs
Average degrees of edge-chromatic critical graphs Yan Cao a,guantao Chen a, Suyun Jiang b,c, Huiqing Liu d, Fuliang Lu e a Department of Mathematics and Statistics, Georgia State University, Atlanta, GA
More informationGroup connectivity of certain graphs
Group connectivity of certain graphs Jingjing Chen, Elaine Eschen, Hong-Jian Lai May 16, 2005 Abstract Let G be an undirected graph, A be an (additive) Abelian group and A = A {0}. A graph G is A-connected
More informationDP-4-COLORABILITY OF PLANAR GRAPHS WITHOUT GIVEN TWO ADJACENT CYCLES
DP-4-COLORABILITY OF PLANAR GRAPHS WITHOUT GIVEN TWO ADJACENT CYCLES RUNRUN LIU 1 AND XIANGWEN LI 1 AND KITTIKORN NAKPRASIT 2 AND PONGPAT SITTITRAI 2 AND GEXIN YU 1,3 1 School of Mathematics & Statistics,
More informationComplexity of conditional colorability of graphs
Complexity of conditional colorability of graphs Xueliang Li 1, Xiangmei Yao 1, Wenli Zhou 1 and Hajo Broersma 2 1 Center for Combinatorics and LPMC-TJKLC, Nankai University Tianjin 300071, P.R. China.
More informationOn star forest ascending subgraph decomposition
On star forest ascending subgraph decomposition Josep M. Aroca and Anna Lladó Department of Mathematics, Univ. Politècnica de Catalunya Barcelona, Spain josep.m.aroca@upc.edu,aina.llado@upc.edu Submitted:
More informationStrong oriented chromatic number of planar graphs without short cycles
Discrete Mathematics and Theoretical Computer Science DMTCS vol. 10:1, 008, 1 4 Strong oriented chromatic number of planar graphs without short cycles Mickaël Montassier 1, Pascal Ochem, and Alexandre
More informationZero sum partition of Abelian groups into sets of the same order and its applications
Zero sum partition of Abelian groups into sets of the same order and its applications Sylwia Cichacz Faculty of Applied Mathematics AGH University of Science and Technology Al. Mickiewicza 30, 30-059 Kraków,
More informationChoice Numbers of Multi-Bridge Graphs
Computer Science Journal of Moldova, vol.25, no.3(75), 2017 Julian Allagan Benkam Bobga Abstract Suppose ch(g) and χ(g) denote, respectively, the choice number and the chromatic number of a graph G = (V,E).
More informationOn (δ, χ)-bounded families of graphs
On (δ, χ)-bounded families of graphs András Gyárfás Computer and Automation Research Institute Hungarian Academy of Sciences Budapest, P.O. Box 63 Budapest, Hungary, H-1518 gyarfas@sztaki.hu Manouchehr
More informationStrong edge-colouring of sparse planar graphs
Strong edge-colouring of sparse planar graphs Julien Bensmail a, Ararat Harutyunyan b, Hervé Hocquard a, Petru Valicov c a LaBRI (Université de Bordeaux), 351 cours de la Libération, 33405 Talence Cedex,
More informationOn colorability of graphs with forbidden minors along paths and circuits
On colorability of graphs with forbidden minors along paths and circuits Elad Horev horevel@cs.bgu.ac.il Department of Computer Science Ben-Gurion University of the Negev Beer-Sheva 84105, Israel Abstract.
More informationZero-Sum Flows in Regular Graphs
Zero-Sum Flows in Regular Graphs S. Akbari,5, A. Daemi 2, O. Hatami, A. Javanmard 3, A. Mehrabian 4 Department of Mathematical Sciences Sharif University of Technology Tehran, Iran 2 Department of Mathematics
More informationAdjacent Vertex Distinguishing Colorings of Graphs
Adjacent Vertex Distinguishing Colorings of Graphs Wang Weifan Department of Mathematics Zhejiang Normal University Jinhua 321004 Page. 1 Total 80 Our Page. 2 Total 80 1 Let G = (V, E) be a simple graph.
More informationUpper Bounds of Dynamic Chromatic Number
Upper Bounds of Dynamic Chromatic Number Hong-Jian Lai, Bruce Montgomery and Hoifung Poon Department of Mathematics West Virginia University, Morgantown, WV 26506-6310 June 22, 2000 Abstract A proper vertex
More informationList-coloring the Square of a Subcubic Graph
List-coloring the Square of a Subcubic Graph Daniel W. Cranston University of Illinois Urbana-Champaign, USA Seog-Jin Kim Konkuk University Seoul, Korea February 1, 2007 Abstract The square G 2 of a graph
More informationELA
A NOTE ON THE LARGEST EIGENVALUE OF NON-REGULAR GRAPHS BOLIAN LIU AND GANG LI Abstract. The spectral radius of connected non-regular graphs is considered. Let λ 1 be the largest eigenvalue of the adjacency
More informationSupereulerian planar graphs
Supereulerian planar graphs Hong-Jian Lai and Mingquan Zhan Department of Mathematics West Virginia University, Morgantown, WV 26506, USA Deying Li and Jingzhong Mao Department of Mathematics Central China
More informationOn two conjectures about the proper connection number of graphs
On two conjectures about the proper connection number of graphs Fei Huang, Xueliang Li, Zhongmei Qin Center for Combinatorics and LPMC arxiv:1602.07163v3 [math.co] 28 Mar 2016 Nankai University, Tianjin
More informationList edge and list total colorings of planar graphs without non-induced 7-cycles
List edge and ist tota coorings of panar graphs without non-induced 7-cyces Aijun Dong, Guizhen Liu, Guojun Li To cite this version: Aijun Dong, Guizhen Liu, Guojun Li. List edge and ist tota coorings
More informationErdős-Gallai-type results for the rainbow disconnection number of graphs
Erdős-Gallai-type results for the rainbow disconnection number of graphs Xuqing Bai 1, Xueliang Li 1, 1 Center for Combinatorics and LPMC arxiv:1901.0740v1 [math.co] 8 Jan 019 Nankai University, Tianjin
More informationA note on the acyclic 3-choosability of some planar graphs
A note on the acyclic 3-choosability of some planar graphs Hervé Hocquard, Mickael Montassier, André Raspaud To cite this version: Hervé Hocquard, Mickael Montassier, André Raspaud. A note on the acyclic
More informationOn the Dynamic Chromatic Number of Graphs
On the Dynamic Chromatic Number of Graphs Maryam Ghanbari Joint Work with S. Akbari and S. Jahanbekam Sharif University of Technology m_phonix@math.sharif.ir 1. Introduction Let G be a graph. A vertex
More informationNeighbor-distinguishing k-tuple edge-colorings of graphs
Neighbor-distinguishing k-tuple edge-colorings of graphs Jean-Luc Baril and Olivier Togni 1 LEI UMR-CNRS 5158, Université de Bourgogne B.P. 7 870, 1078 DIJON-Cedex France e-mail: {barjl,olivier.togni}@u-bourgogne.fr
More informationAcyclic edge coloring of planar graphs with Delta colors
Acyclic edge coloring of planar graphs with Delta colors Dávid Hudák, František Kardoš, Borut Lužar, Roman Soták, Riste Škrekovski To cite this version: Dávid Hudák, František Kardoš, Borut Lužar, Roman
More informationProper connection number and 2-proper connection number of a graph
Proper connection number and 2-proper connection number of a graph arxiv:1507.01426v2 [math.co] 10 Jul 2015 Fei Huang, Xueliang Li, Shujing Wang Center for Combinatorics and LPMC-TJKLC Nankai University,
More informationInjective colorings of sparse graphs
Injective colorings of sparse graphs Daniel W. Cranston Seog-Jin Kim Gexin Yu August 28, 2008 Abstract Let Mad(G) denote the maximum average degree (over all subgraphs) of G and let χ i(g) denote the injective
More informationOn the oriented chromatic index of oriented graphs
On the oriented chromatic index of oriented graphs Pascal Ochem, Alexandre Pinlou, Éric Sopena LaBRI, Université Bordeaux 1, 351, cours de la Libération 33405 Talence Cedex, France February 19, 2006 Abstract
More informationON TWO QUESTIONS ABOUT CIRCULAR CHOOSABILITY
ON TWO QUESTIONS ABOUT CIRCULAR CHOOSABILITY SERGUEI NORINE Abstract. We answer two questions of Zhu on circular choosability of graphs. We show that the circular list chromatic number of an even cycle
More informationGraceful Tree Conjecture for Infinite Trees
Graceful Tree Conjecture for Infinite Trees Tsz Lung Chan Department of Mathematics The University of Hong Kong, Pokfulam, Hong Kong h0592107@graduate.hku.hk Wai Shun Cheung Department of Mathematics The
More informationExtendability of Contractible Configurations for Nowhere-Zero Flows and Modulo Orientations
Graphs and Combinatorics (2016) 32:1065 1075 DOI 10.1007/s00373-015-1636-0 ORIGINAL PAPER Extendability of Contractible Configurations for Nowhere-Zero Flows and Modulo Orientations Yanting Liang 1 Hong-Jian
More informationA Class of Vertex Transitive Graphs
Volume 119 No. 16 2018, 3137-3144 ISSN: 1314-3395 (on-line version) url: http://www.acadpubl.eu/hub/ http://www.acadpubl.eu/hub/ A Class of Vertex Transitive Graphs 1 N. Murugesan, 2 R. Anitha 1 Assistant
More informationAll Good (Bad) Words Consisting of 5 Blocks
Acta Mathematica Sinica, English Series Jun, 2017, Vol 33, No 6, pp 851 860 Published online: January 25, 2017 DOI: 101007/s10114-017-6134-2 Http://wwwActaMathcom Acta Mathematica Sinica, English Series
More informationarxiv: v1 [math.co] 18 Nov 2016
EQUITABLE COLORING OF SPARSE PLANAR GRAPHS arxiv:1611.06031v1 [math.co] 18 Nov 2016 RONG LUO, JEAN-SÉBASTIEN SERENI, D. CHRISTOPHER STEPHENS, AND GEXIN YU Abstract. A proper vertex coloring of a graph
More informationA note on balanced bipartitions
A note on balanced bipartitions Baogang Xu a,, Juan Yan a,b a School of Mathematics and Computer Science Nanjing Normal University, 1 Ninghai Road, Nanjing, 10097, China b College of Mathematics and System
More informationON THE NUMBERS OF CUT-VERTICES AND END-BLOCKS IN 4-REGULAR GRAPHS
Discussiones Mathematicae Graph Theory 34 (2014) 127 136 doi:10.7151/dmgt.1724 ON THE NUMBERS OF CUT-VERTICES AND END-BLOCKS IN 4-REGULAR GRAPHS Dingguo Wang 2,3 and Erfang Shan 1,2 1 School of Management,
More informationA simplified discharging proof of Grötzsch theorem
A simplified discharging proof of Grötzsch theorem Zdeněk Dvořák November 29, 2013 Abstract In this note, we combine ideas of several previous proofs in order to obtain a quite short proof of Grötzsch
More informationUniform Star-factors of Graphs with Girth Three
Uniform Star-factors of Graphs with Girth Three Yunjian Wu 1 and Qinglin Yu 1,2 1 Center for Combinatorics, LPMC Nankai University, Tianjin, 300071, China 2 Department of Mathematics and Statistics Thompson
More informationGraphs and Combinatorics
Graphs and Combinatorics (2005) 21:469 474 Digital Object Identifier (DOI) 10.1007/s00373-005-0625-0 Graphs and Combinatorics Springer-Verlag 2005 On Group Chromatic Number of Graphs Hong-Jian Lai 1 and
More informationSPANNING TREES WITH A BOUNDED NUMBER OF LEAVES. Junqing Cai, Evelyne Flandrin, Hao Li, and Qiang Sun
Opuscula Math. 37, no. 4 (017), 501 508 http://dx.doi.org/10.7494/opmath.017.37.4.501 Opuscula Mathematica SPANNING TREES WITH A BOUNDED NUMBER OF LEAVES Junqing Cai, Evelyne Flandrin, Hao Li, and Qiang
More informationOn Brooks Coloring Theorem
On Brooks Coloring Theorem Hong-Jian Lai, Xiangwen Li, Gexin Yu Department of Mathematics West Virginia University Morgantown, WV, 26505 Abstract Let G be a connected finite simple graph. δ(g), (G) and
More informationarxiv: v1 [math.co] 13 May 2016
GENERALISED RAMSEY NUMBERS FOR TWO SETS OF CYCLES MIKAEL HANSSON arxiv:1605.04301v1 [math.co] 13 May 2016 Abstract. We determine several generalised Ramsey numbers for two sets Γ 1 and Γ 2 of cycles, in
More informationInjective colorings of sparse graphs
Injective colorings of sparse graphs Daniel W. Cranston Seog-Jin Kim Gexin Yu June 10, 2010 Abstract Let mad(g) denote the maximum average degree (over all subgraphs) of G and let χ i(g) denote the injective
More informationDiscrete Mathematics
Discrete Mathematics 09 (2009) 2108 2118 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: www.elsevier.com/locate/disc An oriented coloring of planar graphs with girth at
More informationFIVE-LIST-COLORING GRAPHS ON SURFACES I. TWO LISTS OF SIZE TWO IN PLANAR GRAPHS
FIVE-LIST-COLORING GRAPHS ON SURFACES I. TWO LISTS OF SIZE TWO IN PLANAR GRAPHS Luke Postle 1 Department of Mathematics and Computer Science Emory University Atlanta, Georgia 30323, USA and Robin Thomas
More informationEquitable Colorings of Corona Multiproducts of Graphs
Equitable Colorings of Corona Multiproducts of Graphs arxiv:1210.6568v1 [cs.dm] 24 Oct 2012 Hanna Furmańczyk, Marek Kubale Vahan V. Mkrtchyan Abstract A graph is equitably k-colorable if its vertices can
More informationA LOWER BOUND FOR RADIO k-chromatic NUMBER OF AN ARBITRARY GRAPH
Volume 10, Number, Pages 5 56 ISSN 1715-0868 A LOWER BOUND FOR RADIO k-chromatic NUMBER OF AN ARBITRARY GRAPH SRINIVASA RAO KOLA AND PRATIMA PANIGRAHI Abstract Radio k-coloring is a variation of Hale s
More informationAn Exact Formula for all Star-Kipas Ramsey Numbers
Graphs and Combinatorics 017) 33:141 148 DOI 10.1007/s00373-016-1746-3 ORIGINAL PAPER An Exact Formula for all Star-Kipas Ramsey Numbers Binlong Li 1, Yanbo Zhang 3,4 Hajo Broersma 3 Received: June 015
More informationColoring. Basics. A k-coloring of a loopless graph G is a function f : V (G) S where S = k (often S = [k]).
Coloring Basics A k-coloring of a loopless graph G is a function f : V (G) S where S = k (often S = [k]). For an i S, the set f 1 (i) is called a color class. A k-coloring is called proper if adjacent
More informationSUB-EXPONENTIALLY MANY 3-COLORINGS OF TRIANGLE-FREE PLANAR GRAPHS
SUB-EXPONENTIALLY MANY 3-COLORINGS OF TRIANGLE-FREE PLANAR GRAPHS Arash Asadi Luke Postle 1 Robin Thomas 2 School of Mathematics Georgia Institute of Technology Atlanta, Georgia 30332-0160, USA ABSTRACT
More informationEvery line graph of a 4-edge-connected graph is Z 3 -connected
European Journal of Combinatorics 0 (2009) 595 601 Contents lists available at ScienceDirect European Journal of Combinatorics journal homepage: www.elsevier.com/locate/ejc Every line graph of a 4-edge-connected
More informationOriented vertex and arc colorings of outerplanar graphs
Information Processing Letters 100 (2006) 97 104 www.elsevier.com/locate/ipl Oriented vertex and arc colorings of outerplanar graphs Alexandre Pinlou,1, Éric Sopena LaBRI, Université Bordeaux 1, 351, cours
More informationNear-colorings and Steinberg conjecture
Near-colorings and Steinberg conjecture André Raspaud LaBRI Université Bordeaux I France Department of Mathematics, Zhejiang Normal University, Jinhua, China October 3, 20 Proper k-coloring Proper k-coloring
More informationDiscrete Mathematics
Discrete Mathematics 09 (2009) 49 502 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: www.elsevier.com/locate/disc 2-distance ( + 2)-coloring of planar graphs with girth
More informationand critical partial Latin squares.
Nowhere-zero 4-flows, simultaneous edge-colorings, and critical partial Latin squares Rong Luo Department of Mathematical Sciences Middle Tennessee State University Murfreesboro, TN 37132, U.S.A luor@math.wvu.edu
More informationBalanced bipartitions of graphs
2010.7 - Dedicated to Professor Feng Tian on the occasion of his 70th birthday Balanced bipartitions of graphs Baogang Xu School of Mathematical Science, Nanjing Normal University baogxu@njnu.edu.cn or
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution
More informationNew Upper Bounds for the Heights of Some Light Subgraphs in 1-Planar Graphs with High Minimum Degree
New Upper Bounds for the Heights of Some Light Subgraphs in 1-Planar Graphs with High Minimum Degree Xin Zhang, Jian-Liang Wu, Guizhen Liu To cite this ersion: Xin Zhang, Jian-Liang Wu, Guizhen Liu. New
More information0-Sum and 1-Sum Flows in Regular Graphs
0-Sum and 1-Sum Flows in Regular Graphs S. Akbari Department of Mathematical Sciences Sharif University of Technology Tehran, Iran School of Mathematics, Institute for Research in Fundamental Sciences
More information3-CHOOSABILITY OF TRIANGLE-FREE PLANAR GRAPHS WITH CONSTRAINT ON 4-CYCLES
University of Ljubljana Institute of Mathematics, Physics and Mechanics Department of Mathematics Jadranska 19, 1000 Ljubljana, Slovenia Preprint series, Vol. 47 (2009), 1080 3-CHOOSABILITY OF TRIANGLE-FREE
More informationarxiv: v2 [math.co] 19 Jun 2018
arxiv:1705.06268v2 [math.co] 19 Jun 2018 On the Nonexistence of Some Generalized Folkman Numbers Xiaodong Xu Guangxi Academy of Sciences Nanning 530007, P.R. China xxdmaths@sina.com Meilian Liang School
More informationAn Ore-type Condition for Cyclability
Europ. J. Combinatorics (2001) 22, 953 960 doi:10.1006/eujc.2001.0517 Available online at http://www.idealibrary.com on An Ore-type Condition for Cyclability YAOJUN CHEN, YUNQING ZHANG AND KEMIN ZHANG
More informationThe 3-Color Problem: A relaxation of Havel s problem
The 3-Color Problem: A relaxation of Havel s problem Mickaël Montassier, André Raspaud ( ) LaBRI, Bordeaux, France Weifan Wang, Yingqian Wang Normal Zhejiang University, Jinhua, PRC Coloring Seminar January
More informationCIRCULAR CHROMATIC NUMBER AND GRAPH MINORS. Xuding Zhu 1. INTRODUCTION
TAIWANESE JOURNAL OF MATHEMATICS Vol. 4, No. 4, pp. 643-660, December 2000 CIRCULAR CHROMATIC NUMBER AND GRAPH MINORS Xuding Zhu Abstract. This paper proves that for any integer n 4 and any rational number
More informationOn the chromatic number and independence number of hypergraph products
On the chromatic number and independence number of hypergraph products Dhruv Mubayi Vojtĕch Rödl January 10, 2004 Abstract The hypergraph product G H has vertex set V (G) V (H), and edge set {e f : e E(G),
More informationarxiv: v1 [math.co] 4 Jan 2018
A family of multigraphs with large palette index arxiv:80.0336v [math.co] 4 Jan 208 M.Avesani, A.Bonisoli, G.Mazzuoccolo July 22, 208 Abstract Given a proper edge-coloring of a loopless multigraph, the
More informationNew Constructions of Antimagic Graph Labeling
New Constructions of Antimagic Graph Labeling Tao-Ming Wang and Cheng-Chih Hsiao Department of Mathematics Tunghai University, Taichung, Taiwan wang@thu.edu.tw Abstract An anti-magic labeling of a finite
More informationDirac s Map-Color Theorem for Choosability
Dirac s Map-Color Theorem for Choosability T. Böhme B. Mohar Technical University of Ilmenau, University of Ljubljana, D-98684 Ilmenau, Germany Jadranska 19, 1111 Ljubljana, Slovenia M. Stiebitz Technical
More information3-choosability of triangle-free planar graphs with constraint on 4-cycles
3-choosability of triangle-free planar graphs with constraint on 4-cycles Zdeněk Dvořák Bernard Lidický Riste Škrekovski Abstract A graph is k-choosable if it can be colored whenever every vertex has a
More information(This is a sample cover image for this issue. The actual cover is not yet available at this time.)
(This is a sample cover image for this issue. The actual cover is not yet available at this time.) This article appeared in a journal published by Elsevier. The attached copy is furnished to the author
More informationON GLOBAL DOMINATING-χ-COLORING OF GRAPHS
- TAMKANG JOURNAL OF MATHEMATICS Volume 48, Number 2, 149-157, June 2017 doi:10.5556/j.tkjm.48.2017.2295 This paper is available online at http://journals.math.tku.edu.tw/index.php/tkjm/pages/view/onlinefirst
More informationProperly colored Hamilton cycles in edge colored complete graphs
Properly colored Hamilton cycles in edge colored complete graphs N. Alon G. Gutin Dedicated to the memory of Paul Erdős Abstract It is shown that for every ɛ > 0 and n > n 0 (ɛ), any complete graph K on
More informationLarge topological cliques in graphs without a 4-cycle
Large topological cliques in graphs without a 4-cycle Daniela Kühn Deryk Osthus Abstract Mader asked whether every C 4 -free graph G contains a subdivision of a complete graph whose order is at least linear
More informationarxiv: v2 [math.co] 10 May 2016
The asymptotic behavior of the correspondence chromatic number arxiv:602.00347v2 [math.co] 0 May 206 Anton Bernshteyn University of Illinois at Urbana-Champaign Abstract Alon [] proved that for any graph
More informationTHE EXTREMAL FUNCTIONS FOR TRIANGLE-FREE GRAPHS WITH EXCLUDED MINORS 1
THE EXTREMAL FUNCTIONS FOR TRIANGLE-FREE GRAPHS WITH EXCLUDED MINORS 1 Robin Thomas and Youngho Yoo School of Mathematics Georgia Institute of Technology Atlanta, Georgia 0-0160, USA We prove two results:
More informationEdge-face colouring of plane graphs with maximum degree nine
Edge-face colouring of plane graphs with maximum degree nine Jean-Sébastien Sereni Matěj Stehlík Abstract An edge-face colouring of a plane graph with edge set E and face set F is a colouring of the elements
More informationarxiv: v1 [math.co] 28 Oct 2016
More on foxes arxiv:1610.09093v1 [math.co] 8 Oct 016 Matthias Kriesell Abstract Jens M. Schmidt An edge in a k-connected graph G is called k-contractible if the graph G/e obtained from G by contracting
More information4 CONNECTED PROJECTIVE-PLANAR GRAPHS ARE HAMILTONIAN. Robin Thomas* Xingxing Yu**
4 CONNECTED PROJECTIVE-PLANAR GRAPHS ARE HAMILTONIAN Robin Thomas* Xingxing Yu** School of Mathematics Georgia Institute of Technology Atlanta, Georgia 30332, USA May 1991, revised 23 October 1993. Published
More informationarxiv: v3 [math.co] 25 Apr 2016
On incidence coloring conjecture in Cartesian products of graphs Petr Gregor, Borut Lužar, Roman Soták August 0, 08 arxiv:0.0908v [math.co] Apr 06 Abstract An incidence in a graph G is a pair (v, e) where
More informationPlanar Graphs (1) Planar Graphs (3) Planar Graphs (2) Planar Graphs (4)
S-72.2420/T-79.5203 Planarity; Edges and Cycles 1 Planar Graphs (1) Topological graph theory, broadly conceived, is the study of graph layouts. Contemporary applications include circuit layouts on silicon
More informationThe Singapore Copyright Act applies to the use of this document.
Title On graphs whose low polynomials have real roots only Author(s) Fengming Dong Source Electronic Journal of Combinatorics, 25(3): P3.26 Published by Electronic Journal of Combinatorics This document
More information