Cycles of length 1 modulo 3 in graph
|
|
- Piers Farmer
- 5 years ago
- Views:
Transcription
1 Discrete Applied Mathematics 113 (2001) Note Cycles of length 1 modulo 3 in graph LU Mei, YU Zhengguang Department of Mathematical Sciences, Tsinghua University, Beijing , China Received 9 July 1999; received in revised form 19 October 2000; accepted 30 October 2000 Abstract We prove a conjecture of Saito that if a graph G with 3 has no cycle of length 1 (mod 3), then G has an induced subgraph which is isomorphic to the Petersen graph. The above result strengthened the result by Dean et al. that every 2-connected graph with 3hasa(1mod 3)-cycle if G is not isomorphic to the Petersen graph.? 2001 Elsevier Science B.V. All rights reserved. Keywords: Cycle; Modulo; Chord 1. Introduction We use Bondy and Murty [1] for terminology and notation not dened here and consider simple graphs only. Let G be a graph. If x V (G) and A V (G), then N A (x) is the neighborhood of x in A. When A = V (G), we denote N G (x)=n(x). Let C = v 1 v 2 v t v 1 be a cycle of G. For v i V (C), we use v i + ;vi to denote the successor and predecessor of v i on C, respectively. If v i ;v j V (C), then we use v i Cv j or v j Cv i to denote the v i ;v j -arc of C with the same or opposite orientation with respect to the orientation of C and we will consider v i Cv j and v j Cv i both as paths and as vertex sets. If e = v i v j E(G) \ E(C), then e is said to be a chord of C. Let f = v l v s be another chord of C. Ifv l = v i + and v s v j Cv i then e and f are said to be cross chords of C. Finally, we use l(c) and l(v i Cv j ) to denote the length of C and v i Cv j, respectively. For integers a and b a cycle is said to be an (a mod b)-cycle if its length is a (mod b). In [2], the following theorem is proved. Research supported by National Natural Science Foundation of Chain. Corresponding author. address: mlu@math.tsinghua.edu.cn (L. Mei) X/01/$ - see front matter? 2001 Elsevier Science B.V. All rights reserved. PII: S X(01)
2 330 L. Mei, Y. Zhengguang / Discrete Applied Mathematics 113 (2001) Theorem 1. (Dean et al. [2]). Let G be a 2-connected graph of minimum degree at least 3. (1) If G is not isomorphic to K 4 or K 3;n for some n 3, then G has a (2 mod 3)-cycle. (2) If G is not isomorphic to the Petersen graph, then G has a (1 mod 3)-cycle. In [3], Saito strengthened Theorem 1(1) in the following way. Theorem 2. (Saito [3]). Let G be a graph of minimum degree at least 3. If G has no (2 mod 3) -cycle, then G contains either K 4 or K 3;3 as an induced subgraph. He also conjectured that, under the same assumption, G contains (1 mod 3)-cycle unless G contains the Petersen graph as an induced subgraph. In this paper, we prove this conjecture. Theorem 3. Let G be a graph of 3. If G has no (1 mod 3)-cycle, then G contains the Petersen graph as an induced subgraph. From this theorem, we have: Corollary. Every 3-regular connected graph except for the Petersen graph has a (1 mod 3)-cycle. 2. Some lemma In this section, assume that G has no cycle of length 1 (mod 3), C a cycle in G and uv a chord on C. Lemma 1. (1) If l(c) 0 (mod 3), then l(ucv) 1 (mod 3) and l(vcu) 2 (mod 3) or l(ucv) 2 (mod 3) and l(vcu) 1 (mod 3). (2) If l(c) 2 (mod 3), then l(ucv) l(vcu) 1 (mod 3). Lemma 2. Let l(c) 2 (mod 3) and u 1 ucv. Ifl(uCu 1 ) 1 (mod 3) or l(ucu 1 ) 0( mod 3), then N C (u 1 ) ucv. Proof. Suppose there exists v 1 vcu s.t. u 1 v 1 E(G). Then by Lemma 1 and l(ucu 1 ) 1 (mod 3), l(u 1 Cv) l(v 1 Cu) 0 (mod 3). Thus l(vcv 1 ) 1 (mod 3). But the cycle uvcv 1 u 1 Cu would be a contradiction. The proof of l(ucu 1 ) 0 (mod 3) is similar. Lemma 3. Let l(c) 0 (mod 3), l(ucv) 2 (mod 3) and u 1 ucv. If l(ucu 1 ) 1 (mod 3), then N C (u 1 ) ucv. Specially, N C (u + ) ucv and N C (v ) ucv.
3 L. Mei, Y. Zhengguang / Discrete Applied Mathematics 113 (2001) Proof. Obviously, l(u 1 Cv) 1 (mod 3). If there exists v 1 vcu such that u 1 v 1 E(G), then we can assume that l(v 1 Cu 1 ) 2 (mod 3) by Lemma 1. Thus l(v 1 Cu) 1 (mod 3). But the cycle v 1 Cuv Cu 1 v 1 would be a contradiction. Lemma 4. Let l(c) 0 (mod 3) and l(ucv) 1 (mod 3). If there exists a chord u 1 v 1 in ucv, then N C (u + 1 ) u 1Cv 1 and N C (v 1 ) u 1Cv 1. Proof. Since ucvu is a cycle of length 2 (mod 3), N C (u 1 + ) (ucu 1 v+ 1 Cv)=N C(v 1 ) (ucu 1 v+ 1 Cv)= by Lemma 2. Suppose there exist y 1;y 2 vcu so that y 1 u 1 + ;y 2v 1 E(G). We would consider three cases. (1) l(ucu 1 ) 0 (mod 3) and then l(v 1 Cv) 0 (mod 3). Then the cycles y 1 Cu 1 + y 1 and vcy 1 u 1 + Cuv derive l(y 1 Cu) 2 (mod 3) and l(vcy 1 ) 1 (mod 3). And the cycles v 1 Cy 2v 1 and y 2Cu 1 v 1 v 1 y 2 derive l(vcy 2 ) 2 (mod 3) and l(y 2 Cu) 1 (mod3). Since l(vcu) 2 (mod 3), we have that l(y 1 Cu) 0 (mod 3) or l(vcy 2 ) 0 (mod 3). But the cycles y 1 Cuv Cv 1 u 1 u 1 + y 1 or vcy 2 v 1 v 1u 1 Cuv would be a contradiction. (2) l(ucu 1 ) 1 (mod 3) and then l(v 1 Cv) 2 (mod 3). Then the cycle y 1 Cu 1 + y 1 and v 1 Cy 1 u 1 + u 1v 1 derive l(y 1 Cu) 1 (mod 3) and l(vcy 1 ) 2 (mod 3). The cycles v 1 Cy 2v 1 and y 2Cu 1 v 1 v 1 y 2 derive l(vcy 2 ) 0 (mod 3) and l(y 2 Cu) 0 (mod 3). Since l(vcu) 2 (mod 3), we have l(vcy 1 ) 0 (mod 3) or l(vcy 2 ) 1 (mod 3). But the cycles vcy 1 u 1 + u 1Cuv or vcy 2 v 1 Cuv would be a contradiction. (3) l(ucu 1 ) 2 (mod 3) and then l(v 1 Cv) 1 (mod 3). This situation is similar to (2). From (1) (3), N C (u 1 + ) u 1Cv 1 and N C (v 1 ) u 1Cv Proof of Theorem 3 Assume that G has no cycle of length 1 (mod 3). Let P be the set of longest paths in G. For P = x 1 x 2 x n P, let m(p)=max{l : x l N(x 1 ) V (P)}. Choose P P so that m(p) is as large as possible. Let m(p)=m, then m 4 and C = x 1 x m x 1 is a cycle. Choose x t such that x t is the rst vertex in x + 2 Px m with x 1 x t E(G). Then x 1 x t is a chord of C. In the following proof, we would use the Search Procedure S 1 (x; y) on C. Search Procedure S 1 (x; y) (x; y V(C)): Step 1. Let u 0 :=x and v 0 :=y; i:=1. Step 2. u i :=v i 1 (i 1 (mod 2)) or u i:=v + i 1 (i 0 (mod 2)). If d C(u i )=2 or N(u i ) \ u i 1 Cv i 1 (i 1 (mod 2)) or N(u i ) \ v i 1 Cu i 1 (i 0 (mod 2)), then stop; else v i N (u i ) \{u + i ;u i }, i:=i + 1 and goto Step 2.
4 332 L. Mei, Y. Zhengguang / Discrete Applied Mathematics 113 (2001) Claim 1. l(c) 0 (mod 3) and then l(x 1 Px m ) 2 (mod 3). Proof. Suppose l(c) 2 (mod 3). Then by Lemma 2 and the choice of P, S 1 (x 1 ;x t ) would stop at a vertex u i such that d(u i ) = 2, a contradiction. Claim 2. Assume, without loss of generality, that l(x 1 Cx t ) 1 (mod 3). Proof. If l(x 1 Cx t ) 2 (mod 3) then replace P by P = x m 1 Px 1 x m Px n and assume x is the rst vertex in x m 3 Px m with x x m 1 E(G). If x x t Px m 3 then l(x m 1 P x ) 1 (mod 3) by Lemma 1. If x x 1 Px t and l(x m 1 P x ) 2 (mod 3), then l(x Px t ) 0 (mod 3) by l(x t Px m 1 ) 2 (mod 3). But the cycle x Px t x 1 x m x m 1 x would be a contradiction. Hence l(x m 1 P x ) 1 (mod 3). Claim 3. There exists x s x t+1 Cx m such that x s x t 1 E(G) and l(x t Cx s ) 0 (mod 3). Proof. Obviously, N (x t 1 ) V (C). If N(x t 1 ) x 1 Cx t, assume y N(x t 1 ) x 1 Cx t, then by Lemma 4 and the choice of P, S 1 (x t 1 ;y) would stop at u i with d(u i )=2, a contradiction. Hence there exists x s x t+1 Cx m such that x s x t 1 E(G). Obviously, l(x s Cx 1 ) 1 (mod 3) and l(x t Cx s ) 2 (mod 3). But l(x t Cx 1 ) 2 (mod 3), so l(x t Cx s ) 0 (mod 3) and l(x s Cx 1 ) 2 (mod 3). Claim 4. There exists x l x 2 Cx t 1 such that x l x s 1 E(G) and l(x 1 Cx l ) 1 (mod 3). Proof. By the choice of P, N (x s 1 ) V (C). Since l(x t 1 Cx s ) 1 (mod 3), there exists x l x t 2 Cx s+1 such that x l x s 1 E(G) by Claim 3. If x l x s+1 Cx 1, then l(x s Cx l ) 2 (mod 3) and the cycle x l Cx t 1 x s x s 1 x l derives l(x l Cx 1 ) 1 (mod 3). Hence l(x s Cx l ) 0 (mod 3), l(x l Cx 1 ) 2 (mod 3) and x l x 1. But the cycle x l Cx 1 x t x t 1 x s x s 1 x l would be a contradiction. Therefore x l x 2 Cx t 1. Let x l be the rst vertex in x 2 Cx t 1 with x l x s 1 E(G). By Lemma 3, l(x s 1 Cx l ) 1 (mod 3) and l(x 1 Cx l ) 1 (mod 3): Claim 5. s = m 1. Proof. Suppose s m 1, then N(x m 1 ) V (C) by the choices of P. Denote y N(x m 1 )\{x m ;x m 2 }.Ify x t Cx s 1 thenthe cycles x t Cyx m 1 x m x 1 x t and x t 1 Cyx m 1 Cx s x t 1 derive l(x t Cy) 0 (mod 3) and l(x t Cy) 1 (mod 3). So l(x t Cy) 2 (mod 3) and then l(ycx s ) 1 (mod 3). But the cycle ycx s x t 1 x t x 1 x m x m 1 y would be a contradiction. If y x 1 Cx l, then l(x m 1 Cy) 1 (mod 3) by the cycle x s 1 Cx l x s 1 with length 2 (mod 3). By Claim 4, l(x 1 Cx l ) 1 (mod 3) and then l(ycx l ) 2 (mod 3). But the cycle ycx l x s 1 x s x t 1 x t x 1 x m x m 1 y would be a contradiction. If y x + l Cx t 1, then the cycles x l Cyx m 1 Cx s 1 x l and ycx t 1 x s Cx m 1 y derive l(x l Cy) 1 (mod 3) and l(ycx t 1 ) 2 (mod 3), respectively. Since l(x l Cx t 1 )
5 L. Mei, Y. Zhengguang / Discrete Applied Mathematics 113 (2001) (mod 3), l(x l Cy) 2 (mod 3) and l(ycx t 1 ) 0 (mod 3). But the cycle ycx t 1 x s x s 1 x l Cx m 1 y would be a contradiction. Therefore y x s Cx m. Since l(x s 1 Cx l ) 1 (mod 3), N(y + ) ycx m 1 by Lemma 4 and the choice of P. Thus S 1 (x m 1 ;y) would stop at u i with d(u i ) = 2, a contradiction. Claim 6. x l = x 2. Proof. Suppose x l x 2, then N(x 2 ) V (C). Let y N(x 2 ) \{x 1 ;x 3 }. Obviously, y {x m 1 ;x t ;x t 1 } and y x m by Lemma 2. If y x + l Cx t 1, then l(x 2 Cy) 1 (mod 3) by Lemma 1. Thus l(x l Cy) 1 (mod 3). But the cycle x l Cyx 2 x 1 x m x m 1 x m 2 x l would be a contradiction. If y x t Cx m 2, then the cycles yx 2 Cy and x t Cyx 2 x 1 x t derive l(ycx m 2 ) 2 (mod 3) and l(x t Cy) 1 (mod 3). Since l(x t Cx m 2 ) 2 (mod 3), l(x t Cy) 2 (mod 3) and l(ycx m 2 ) 0 (mod 3). But the cycle x l Cx 2 y Cx t 1 x m 1 x m 2 x l would be a contradiction. Hence y x 3 Cx l. So S 1 (x 2 ;y) would stop at u i with d(u i ) = 2 by Lemma 4, a contradiction. Claim 7. d(x 1 )=d(x m 1 )=d(x 2 )=d(x m 2 )=3. Proof. Suppose there exists y V (C) \{x m ;x 2 } such that yx 1 E(G), then y x t+1 Cx m 1 by the choice of x t. Obviously, y x m 2 and y x m 1. On the other hand, the cycles ycx 1 y and x t Cyx 1 x 2 x m 2 x m 1 x t 1 x t derive l(ycx m 2 ) 0 (mod 3) and l(x t Cy) 1 (mod 3). Since l(x t Cx m 2 ) 2 (mod 3), l(ycx m 2 ) 2 (mod 3). But the cycle ycx m 1 x t 1 x t x 1 y would be a contradiction. Hence d(x 1 )=3. Suppose there exists y V (C) \{x 1 ;x 3 } such that y x 2 E(G), then y {x m 1 ;x m }.Ify x 3 Cx t, then S 1 (x 2 ;y ) would stop at u i with d(u i ) = 2 by the choice of P and Lemma 4, a contradiction. So y x t Cx m 3. Since the cycles y Cx m 2 x 2 y and x t Cy x 2 x 1 x t derive l(y Cx m 2 ) 2 (mod 3) and l(x t Cy ) 1 (mod 3), l(x t Cy ) 2 (mod 3). But the cycle x t 1 Cy x 2 x m 2 x m 1 x t 1 would be a contradiction. Hence d(x 2 )=3. By the proof of Claims 5 and 6, d(x m 1 )=d(x m 2 )=3. Claim 8. N (x 3 ) V (P). Proof. Suppose there exists y 0 V (P) s.t. x 3 y 0 E(G), then N(y 0 ) V (C) bythe choice of P. Let y 1 N (y 0 ) \{x 3 }, then y 1 x t.ify 1 x 4 Cx t 1, then the cycles x 3 Cy 1 y 0 x 3 and x 3 y 0 y 1 Cx t x 1 x 2 x 3 force l(x 3 Cy 1 ) 1 (mod 3). But when l(x 3 Cy 1 ) 1 (mod 3), we have l(y 1 Cx 3 ) 2 (mod 3) and then the cycle y 1 Cx 3 y 0 y 1 would be a contradiction. If there exist y 1 ;y 2 x t+1 Cx m 3, say y 2 y + 1 Cx m 3, such that y 1 ;y 2 N(y 0 ), then the cycles y 0 y 1 Cy 2 y 0 and y 0 y 2 Cy 1 y 0 derive l(y 1 Cy 2 ) 2 (mod 3) and
6 334 L. Mei, Y. Zhengguang / Discrete Applied Mathematics 113 (2001) l(y 2 Cy 1 ) 2 (mod 3). Since l(c) 0 (mod 3), l(y 2 Cy 1 ) 0 (mod 3). But the cycle y 0 y 2 Cy 1 y 0 has a chords x 1 x t, x 2 x m 2, a contradiction with Lemma 2. Hence N(y 0 ) x t+1 Cx m 3 1. Since 3, x m y 0 E(G). Obviously, t 5. Then the path x 4 Px t 1 x m 1 Px t x 1 x 2 x 3 y 0 x m Px n would be longer than P, a contradiction. Claim 9. There exists x k x m+1 Px n such that x k x 3 E(G) and l(x m Px k ) 1 (mod 3). Proof. Suppose that N (x 3 ) V (C). Since l(x m 1 Cx t 1 ) 2 (mod3), N(x 3 ) x m 1 Cx t 1 by Lemma 3. By Claim 7 and the fact x 3 x m E(G), N(x 3 ) x 2 Cx t 1. Denote x 3 N(x 3) \{x 2 ;x 4 }, then l(x 3 Cx 3 ) 1 (mod 3). Thus S 1(x 3 ;x 3 ) would stop at N(u 2i+1 ) \ (u 2i Cv 2i ) or N (u 2i ) \ v 2i 1 Cu 2i 1. Assume N(u 2i+1 ) \{u 2i Cv 2i }, then by Lemma 4, we just have N (u 2i+1 ) x m+1 Px n or N(u 2i+1 ) \ V (P). We use induction to prove l(x 3 Cu k ) 0 (mod 3) for k =1; 2;:::. Since l(x 3 Cx 3 ) 1 (mod 3), l(x 3 Cu 1 ) 0 (mod 3). Suppose it is true for all integers less than k. Assume k is an even number. Since l(x 3 Cx 3 x 3) 2 (mod 3), l(v k 1 Cu k 1 ) 1 (mod 3) by Lemma 1. Hence l(u k Cu k 1 ) 0 (mod 3) and then l(x 3 Cu k ) 0 (mod 3). Specially, l(x 3 Cu 2i+1 ) 0 (mod 3). If there exists v N (u 2i+1 ) x m+1 Px n, then the cycles x m Cu 2i+1 v Px m and u 2i+1 Cx 3 x 3x 2 x 1 x m Pvu 2i+1 derive l(x m Pv) 0 (mod 3) and l(x m Pv) 1 (mod 3). But when l(x m Pv) 2 (mod 3), the cycle u 2i+1 Cx 3 x 2 x m 2 x m 1 x m Pvu 2i+1 would be a contradiction. If there exists y 0 V (P) such that y 0 u 2i+1 E(G), then by the choice of P, N(y 0 ) V (C). If there exists y 1 N (y 0 ) x 2 Cx t 1 and y 1 u 2i+1, assume y 1 u 2i+1 Cx t 1, then the cycles u 2i+1 Cy 1 y 0 u 2i+1 and y 1 Cu 2i+1 y 0 y 1 derive l(u 2i+1 Cy 1 ) 2 (mod 3) and l(y 1 Cu 2i+1 ) 2 (mod 3). Since l(c) 0 (mod 3), l(y 1 Cu 2i+1 ) 0 (mod 3). But the cycle y 1 Cu 2i+1 y 0 y 1 has a cross chords x 1 x t and x 2 x m 2, a contradiction with Lemma 2. Hence N (y 0 ) x 2 Cx t 1 = {u 2i+1 } and similarly, N(y 0 ) x t Cx m 2 1. Hence x m u 2i+1 E(G) and the cycle u 2i+1 Cx 3 x 3x 2 x 1 x m y 0 u 2i+1 would be a contradiction. Hence there exists x k x m+1 Px n s.t. x 3 x k E(G). Obviously, the cycles x m Px k x 3 x 2 x 1 x m and x m Px k x 3 Cx t x 1 x m derive l(x m Px k ) 1 (mod 3). Claim 10. t =5. Proof. Suppose t 5, then x t 2 exists. If v 0 V (P) s.t. x t 2 v 0 E(G), then N(v 0 ) V (C) by the choice of P. Obviously, N (v 0 ) x 2 Cx t 1 ={x t 2 } and N(v 0 ) x t Cx m 2 1. Hence x m v 0 E(G). But the cycle x 3 Cx t 2 v 0 x m Px k x 3 would be a contradiction. Thus N(x t 2 ) V (P). Let y N (x t 2 ) \{x t 1 ;x t 3 }, then y x m 1. Since l(x m 1 Cx t 1 ) 2 (mod 3), N C (x t 2 ) x m Cx t 1 by Lemma 3. If y x m Px n then the cycles x 1 x m Pyx t 2 x t 1 x t x 1 and x 1 x m Pyx t 2 Cx 1 derive l(x m Py) 1 (mod 3). But the cycles x t 2 y Px k x 3 x 2 x m 2 x m 1 x t 1 x t 2 (x k x m Py) and x t 2 ypx k x 3 x 2 x m 2 x m 1 x t 1 x t 2 (y x m Px k ) would be a contradiction. Therefore y x 2 Cx t 2. Then by the same proof as that of Claim 9, we can derive a contradiction.
7 L. Mei, Y. Zhengguang / Discrete Applied Mathematics 113 (2001) Claim 11. m =9. Proof. By Claim 10 and replacing P with x m 1 Px 1 x m Px n, we have m = 9 and there exists x h x m Px n such that x 6 x h E(G) and l(x m Px h ) 1 (mod 3). By Claims 7, 10, 11 and the choice of P, we have Note 1 d(x 1 )=d(x 2 )=d(x 4 )=d(x 5 )=d(x 7 )=d(x 8 )=3. By the proofs of Claims 9 and 11, we have Note 2 For any x 9 x k path P 1 x m Px n and x 9 x h path P 2 x m Px n, l(p 1 ) l(p 2 ) 1 (mod 3). Claim 12. k = 10. Proof. Suppose that k 10. We rst use the following Search Procedure (2) to get a x 9 x k path. Search Procedure S 2 (x; y) (x; y V (P)): Step 1. Let a 0 :=x; b 0 :=y; i:=0. Step 2. Let a i :=b i 1 (on P). If N (a i) b + i 1 Px n =, then stop; else let b i :=N(a i ) b + i 1 Px n, i:=i + 1 and goto step 2. Suppose that S 2 (x 9 ;x k ) stop at i 0 +1 (assume, i 0 1 (mod 2)), then we have a x 9 x k path Q =x 9 Pa 1 b 1 P a i0 b i0 Pb i0 1a i0 1 b 2 a 2 Px k. By Note 2, l(q) 1 (mod 3). Thus we have a cycle C = x 1 x 9 Qx k x 3 x 2 x 7 x 6 x 5 x 1 with length 2 (mod 3): P(1) For any x V (Q), if there exists y V (Q) so that xy E(G), then N(y) (V (C) V (Q)) 2. Let y 0 N (y) (V (C) Q), then y 0 {x 6 } Q by Claim 8 and Note 1. If y 0 Q\{x}, say y 0 x 9 Qx, then l(y 0 Qx) 0 (mod 3) and l(y 0 Qx) 2 (mod 3) by l(c ) 2 (mod 3). Thus l(y 0 Qx) 1 (mod 3) and then we have a x 9 x k path x 9 Qy 0 yxqx k which has length 2 (mod 3), a contradiction with Note 2. So N(y) (V (C) Q) {x 6 ;x}. Next we would consider a i0+1 and would show N(a i0+1) b i0 C b i0 1, that is, N(a i0+1) b i0 1Pb i0. If there exists y V (P) such that ya i0+1 E(G), then N(y) x 1 Pb i0 by the choice of P. Thus d(y) 2 by P(1), a contradiction. Hence N(a i0+1) x 1 Pb i0. When i 0 3, we have a parallel chords a i0 b i0 1, b i0 2a i0 1 in C and l(c ) 2 (mod 3) and l(b i0 2C a i0+1) 1 (mod 3), then N(a i0+1) b i0 2C a i0 1 by Lemma 2. Let b i0+1 N(a i0+1) and b i0+1 is not the successor or predecessor of a i0+1 on C. Obviously, b i0+1 a i0 1;a i0. If b i0+1 b i0 2C a i0, then the cycles b i0+1c a i0+1b i0+1 and b i0+1a i0+1c a i0 1b i0 2C b i0+1 derive l(b i0+1c a i0 ) 1 (mod3) and l(b i0 2C b i0+1) 2 (mod3). By l(b i0 2C a i0 ) 2 (mod3), l(b i0 2C b i0+1) 0 (mod 3). Since l(x 9 C b i0 2) +l(a i0 1C x k ) 0 (mod 3), the x 9 x k path x 9 C b i0+1a i0+1b i0 a i0 b i0 1C x k would contradict with Note 2. Therefore N (a i0+1) b i0 C b i0 1. If i 0 = 1, we similarly have N(a 2 ) x k Pb 1.
8 336 L. Mei, Y. Zhengguang / Discrete Applied Mathematics 113 (2001) By S 2 (a i0+1;b i0+1), we would have a vertex u j0+1 with N(u j0+1) \ V (C ) by l(c ) 2 (mod 3). By P(1) and the choice of P, N(u j0+1) V (P), thus N(u j0+1) b i0 Px n by Note 1. Let v j0+1 N (u j0+1) b i0 Px n, then we have a x 9 x k path Q = x 9 a 1 b 1 P a i0 b i0 Pv j0+1u j0+1pu j0 v j0 P u 0 v 0 Pb i0 a i0 P b 2 a 2 Px k (assume, j 0 1 (mod2)) with length 1 (mod 3) by Note 2. Thus, the cycle x 1 x 9 Q x k x 3 x 2 x 7 x 6 x 5 x 1 with length 2 (mod 3) but has a cross chords b i0 u 0 ;v 0 u 1, a contradiction with Lemma 2. Hence k = 10. Similarly, we have: Claim 13. h = 10. Thus, G[{x 1 ; ;x 10 }] is a Petersen graph. Acknowledgements The authors express their deep thanks to the referees and editors for their helpful suggestions for the improvement of this work. References [1] J.A. Bondy, U.S.R. Murty, Graph Theory with Applications, Macmillan Press, London, [2] N. Dean, A. Kaneko, K. Ota, B. Toft, Cycle modulo 3, preprint. [3] A. Saito, Cycle of length 2 modulo 3 in graph, Discrete Math. 101 (1992)
Pancyclicity in claw-free graphs
Discrete Mathematics 56 (00) 151 160 www.elsevier.com/locate/disc Pancyclicity in claw-free graphs R.J. Gould, F. Pfender Department of Mathematics and Computer Science, Emory University, Atlanta, GA 303,
More informationNeighborhood intersections and Hamiltonicity in almost claw-free graphs
Discrete Mathematics 243 (2002) 171 185 www.elsevier.com/locate/disc Neighborhood intersections and Hamiltonicity in almost claw-free graphs Mingquan Zhan Department of Mathematics, West Virginia University,
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 informationDiscrete Mathematics
Discrete Mathematics 309 (009) 3811 380 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: www.elsevier.com/locate/disc Disjoint hamiltonian cycles in bipartite graphs Michael
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 informationEvery 3-connected, essentially 11-connected line graph is hamiltonian
Every 3-connected, essentially 11-connected line graph is hamiltonian Hong-Jian Lai, Yehong Shao, Hehui Wu, Ju Zhou October 2, 25 Abstract Thomassen conjectured that every 4-connected line graph is hamiltonian.
More informationUniversity of Twente. Faculty of Mathematical Sciences. Strengthening the closure concept in claw-free graphs
Faculty of Mathematical Sciences University of Twente University for Technical and Social Sciences PO Box 217 7500 AE Enschede The Netherlands Phone: +31-53-4893400 Fax: +31-53-4893114 Email: memo@mathutwentenl
More informationDegree Sum Conditions and Vertex-Disjoint Cycles in a Graph
Degree Sum Conditions and Vertex-Disjoint Cycles in a Graph Shinya Fujita Hajime Matsumura Department of Mathematics Keio University Yokohama 223-8522, Japan shinyaa@comb.math.keio.ac.jp musimaru@comb.math.keio.ac.jp
More informationNowhere-zero 3-flows in triangularly connected graphs
Nowhere-zero 3-flows in triangularly connected graphs Genghua Fan 1, Hongjian Lai 2, Rui Xu 3, Cun-Quan Zhang 2, Chuixiang Zhou 4 1 Center for Discrete Mathematics Fuzhou University Fuzhou, Fujian 350002,
More informationEvery 3-connected, essentially 11-connected line graph is Hamiltonian
Journal of Combinatorial Theory, Series B 96 (26) 571 576 www.elsevier.com/locate/jctb Every 3-connected, essentially 11-connected line graph is Hamiltonian Hong-Jian Lai a, Yehong Shao b, Hehui Wu a,
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 information{2, 2}-Extendability of Planar Graphs
International Journal of Engineering Research and Development e-issn: 2278-067X, p-issn: 2278-800X, www.ijerd.com Volume 6, Issue 6 (March 2013), PP. 61-66 {2, 2}-Extendability of Planar Graphs Dharmaiah
More informationUniquely 2-list colorable graphs
Discrete Applied Mathematics 119 (2002) 217 225 Uniquely 2-list colorable graphs Y.G. Ganjali a;b, M. Ghebleh a;b, H. Hajiabolhassan a;b;, M. Mirzazadeh a;b, B.S. Sadjad a;b a Institute for Studies in
More informationSolution to a problem on hamiltonicity of graphs under Oreand Fan-type heavy subgraph conditions
Noname manuscript No. (will be inserted by the editor) Solution to a problem on hamiltonicity of graphs under Oreand Fan-type heavy subgraph conditions Bo Ning Shenggui Zhang Binlong Li Received: date
More informationStrongly chordal and chordal bipartite graphs are sandwich monotone
Strongly chordal and chordal bipartite graphs are sandwich monotone Pinar Heggernes Federico Mancini Charis Papadopoulos R. Sritharan Abstract A graph class is sandwich monotone if, for every pair of its
More informationDiscrete Mathematics
Discrete Mathematics 3 (0) 333 343 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: wwwelseviercom/locate/disc The Randić index and the diameter of graphs Yiting Yang a,
More informationThe super connectivity of shuffle-cubes
Information Processing Letters 96 (2005) 123 127 www.elsevier.com/locate/ipl The super connectivity of shuffle-cubes Jun-Ming Xu a,,minxu b, Qiang Zhu c a Department of Mathematics, University of Science
More informationSome operations preserving the existence of kernels
Discrete Mathematics 205 (1999) 211 216 www.elsevier.com/locate/disc Note Some operations preserving the existence of kernels Mostafa Blidia a, Pierre Duchet b, Henry Jacob c,frederic Maray d;, Henry Meyniel
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 informationHamiltonian problem on claw-free and almost distance-hereditary graphs
Discrete Mathematics 308 (2008) 6558 6563 www.elsevier.com/locate/disc Note Hamiltonian problem on claw-free and almost distance-hereditary graphs Jinfeng Feng, Yubao Guo Lehrstuhl C für Mathematik, RWTH
More informationPartitioning a graph into cycles with a specified number of chords
Partitioning a graph into cycles with a specified number of chords Shuya Chiba Suyun Jiang Jin Yan arxiv:1808.03893v1 [math.co] 1 Aug 018 Abstract For a graph G, letσ (G) be the minimum degree sum of two
More informationEulerian Subgraphs and Hamilton-Connected Line Graphs
Eulerian Subgraphs and Hamilton-Connected Line Graphs Hong-Jian Lai Department of Mathematics West Virginia University Morgantown, WV 2606, USA Dengxin Li Department of Mathematics Chongqing Technology
More informationOn the reconstruction of the degree sequence
Discrete Mathematics 259 (2002) 293 300 www.elsevier.com/locate/disc Note On the reconstruction of the degree sequence Charles Delorme a, Odile Favaron a, Dieter Rautenbach b;c; ;1 a LRI, Bât. 490, Universite
More informationEvery 4-connected line graph of a quasi claw-free graph is hamiltonian connected
Discrete Mathematics 308 (2008) 532 536 www.elsevier.com/locate/disc Note Every 4-connected line graph of a quasi claw-free graph is hamiltonian connected Hong-Jian Lai a, Yehong Shao b, Mingquan Zhan
More informationCYCLES CONTAINING SPECIFIED EDGES IN A GRAPH CYKLE ZAWIERAJĄCE WYBRANE KRAWĘDZIE GRAFU
GRZEGORZ GANCARZEWICZ CYCLES CONTAINING SPECIFIED EDGES IN A GRAPH CYKLE ZAWIERAJĄCE WYBRANE KRAWĘDZIE GRAFU A b s t r a c t The aim of this paper is to prove that if s 1 and G is a graph of order n 4s
More informationLongest paths in strong spanning oriented subgraphs of strong semicomplete multipartite digraphs
Longest paths in strong spanning oriented subgraphs of strong semicomplete multipartite digraphs Gregory Gutin Department of Mathematical Sciences Brunel, The University of West London Uxbridge, Middlesex,
More informationNon-separating 2-factors of an even-regular graph
Discrete Mathematics 308 008) 5538 5547 www.elsevier.com/locate/disc Non-separating -factors of an even-regular graph Yusuke Higuchi a Yui Nomura b a Mathematics Laboratories College of Arts and Sciences
More informationNew sufficient condition for Hamiltonian graphs
Applied Mathematics Letters ( ) www.elsevier.com/locate/aml New sufficient condition for Hamiltonian graphs Kewen Zhao a,b,,hong-jian Lai c,yehong Shao d a Department of Mathematics, Qiongzhou University,
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 informationSolution of a conjecture of Volkmann on the number of vertices in longest paths and cycles of strong semicomplete multipartite digraphs
Solution of a conjecture of Volkmann on the number of vertices in longest paths and cycles of strong semicomplete multipartite digraphs Gregory Gutin Department of Computer Science Royal Holloway University
More informationFour-coloring P 6 -free graphs. I. Extending an excellent precoloring
Four-coloring P 6 -free graphs. I. Extending an excellent precoloring Maria Chudnovsky Princeton University, Princeton, NJ 08544 Sophie Spirkl Princeton University, Princeton, NJ 08544 Mingxian Zhong Columbia
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 informationPancyclic out-arcs of a vertex in tournaments
Discrete Applied Mathematics 99 (2000) 245 249 Pancyclic out-arcs of a vertex in tournaments Tianxing Yao a, Yubao Guo b; ;1, Kemin Zhang a a Department of Mathematics, Nanjing University, Nanjing 210008,
More informationLaplacian spectral radius of trees with given maximum degree
Available online at www.sciencedirect.com Linear Algebra and its Applications 429 (2008) 1962 1969 www.elsevier.com/locate/laa Laplacian spectral radius of trees with given maximum degree Aimei Yu a,,1,
More informationDegree Sequence and Supereulerian Graphs
Degree Sequence and Supereulerian Graphs Suohai Fan, Hong-Jian Lai, Yehong Shao, Taoye Zhang and Ju Zhou January 29, 2007 Abstract A sequence d = (d 1, d 2,, d n ) is graphic if there is a simple graph
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 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 informationA Fan-Type Condition for Hamiltonian Graphs *
A Fan-Type Condition for Hamiltonian Graphs * Gao Taiping Department of Mathematics, University of Shanxi Taiyuan, Shanxi 030006, People's Republic of China Song Wenjie and Wang Jianzhong Department of
More informationMaximum graphs with a unique minimum dominatingset
Discrete Mathematics 60 (003) 197 03 www.elsevier.com/locate/disc Note Maximum graphs with a unique minimum dominatingset Miranca Fischermann, Dieter Rautenbach ;1, Lutz Volkmann Lehrstuhl II fur Mathematik,
More informationMinimizing the Laplacian eigenvalues for trees with given domination number
Linear Algebra and its Applications 419 2006) 648 655 www.elsevier.com/locate/laa Minimizing the Laplacian eigenvalues for trees with given domination number Lihua Feng a,b,, Guihai Yu a, Qiao Li b a School
More informationPancyclicity of 4-connected {Claw, Generalized Bull} - free Graphs
Pancyclicity of 4-connected {Claw, Generalized Bull} - free Graphs Michael Ferrara 1 Silke Gehrke 2 Ronald Gould 2 Colton Magnant 3 Jeffrey Powell 4 November 7, 2012 Abstract A graph G is pancyclic if
More informationMaximising the number of induced cycles in a graph
Maximising the number of induced cycles in a graph Natasha Morrison Alex Scott April 12, 2017 Abstract We determine the maximum number of induced cycles that can be contained in a graph on n n 0 vertices,
More informationCHVÁTAL-ERDŐS CONDITION AND PANCYCLISM
Discussiones Mathematicae Graph Theory 26 (2006 ) 335 342 8 9 13th WORKSHOP 3in1 GRAPHS 2004 Krynica, November 11-13, 2004 CHVÁTAL-ERDŐS CONDITION AND PANCYCLISM Evelyne Flandrin, Hao Li, Antoni Marczyk
More informationLong cycles in 3-cyclable graphs
Long cycles in 3-cyclable graphs D. Bauer 1 L. McGuire 1 H. Trommel 2 H. J. Veldman 2 1 Department of Mathematical Sciences, Stevens Institute of Technology Hoboken, NJ 07030, USA 2 Faculty of Applied
More informationDomination in Cayley Digraphs of Right and Left Groups
Communications in Mathematics and Applications Vol. 8, No. 3, pp. 271 287, 2017 ISSN 0975-8607 (online); 0976-5905 (print) Published by RGN Publications http://www.rgnpublications.com Domination in Cayley
More informationRainbow Connection in Oriented Graphs
Rainbow Connection in Oriented Graphs Paul Dorbec a,b, Ingo Schiermeyer c, Elżbieta Sidorowicz d and Éric Sopenaa,b a Univ. Bordeaux, LaBRI, UMR5800, F-33400 Talence b CNRS, LaBRI, UMR5800, F-33400 Talence
More informationarxiv: v1 [math.co] 29 Apr 2016
Sufficient conditions for hamiltonian cycles in bipartite digraphs Samvel Kh. Darbinyan Institute for Informatics and Automation Problems, Armenian National Academy of Sciences E-mail: samdarbin@ipia.sci.am
More informationCycles in 4-Connected Planar Graphs
Cycles in 4-Connected Planar Graphs Guantao Chen Department of Mathematics & Statistics Georgia State University Atlanta, GA 30303 matgcc@panther.gsu.edu Genghua Fan Institute of Systems Science Chinese
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 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 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 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 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 informationCombined degree and connectivity conditions for H-linked graphs
Combined degree and connectivity conditions for H-linked graphs FLORIAN PFENDER Universität Rostock Institut für Mathematik D-18055 Rostock, Germany Florian.Pfender@uni-rostock.de Abstract For a given
More informationHAMILTONIAN PROPERTIES OF TRIANGULAR GRID GRAPHS. 1. Introduction
HAMILTONIAN PROPERTIES OF TRIANGULAR GRID GRAPHS VALERY S. GORDON, YURY L. ORLOVICH, FRANK WERNER Abstract. A triangular grid graph is a finite induced subgraph of the infinite graph associated with the
More informationOn graphs with a local hereditary property
Discrete Mathematics 236 (2001) 53 58 www.elsevier.com/locate/disc On graphs with a local hereditary property Mieczys law Borowiecki a;, Peter Mihok b a Institute of Mathematics, Technical University of
More informationConnectivity of graphs with given girth pair
Discrete Mathematics 307 (2007) 155 162 www.elsevier.com/locate/disc Connectivity of graphs with given girth pair C. Balbuena a, M. Cera b, A. Diánez b, P. García-Vázquez b, X. Marcote a a Departament
More informationLower bounds on the minus domination and k-subdomination numbers
Theoretical Computer Science 96 (003) 89 98 www.elsevier.com/locate/tcs Lower bounds on the minus domination and k-subdomination numbers Liying Kang a;, Hong Qiao b, Erfang Shan a, Dingzhu Du c a Department
More informationDomination and Total Domination Contraction Numbers of Graphs
Domination and Total Domination Contraction Numbers of Graphs Jia Huang Jun-Ming Xu Department of Mathematics University of Science and Technology of China Hefei, Anhui, 230026, China Abstract In this
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 information4-coloring P 6 -free graphs with no induced 5-cycles
4-coloring P 6 -free graphs with no induced 5-cycles Maria Chudnovsky Department of Mathematics, Princeton University 68 Washington Rd, Princeton NJ 08544, USA mchudnov@math.princeton.edu Peter Maceli,
More informationAALBORG UNIVERSITY. Total domination in partitioned graphs. Allan Frendrup, Preben Dahl Vestergaard and Anders Yeo
AALBORG UNIVERSITY Total domination in partitioned graphs by Allan Frendrup, Preben Dahl Vestergaard and Anders Yeo R-2007-08 February 2007 Department of Mathematical Sciences Aalborg University Fredrik
More informationComputing Sharp 2-factors in Claw-free Graphs
Computing Sharp 2-factors in Claw-free Graphs Hajo Broersma and Daniël Paulusma Department of Computer Science, Durham University, DH1 3LE Durham, United Kingdom, {hajo.broersma,daniel.paulusma}@durham.ac.uk
More informationErdös-Ko-Rado theorems for chordal and bipartite graphs
Erdös-Ko-Rado theorems for chordal and bipartite graphs arxiv:0903.4203v2 [math.co] 15 Jul 2009 Glenn Hurlbert and Vikram Kamat School of Mathematical and Statistical Sciences Arizona State University,
More informationOn the Randić index. Huiqing Liu. School of Mathematics and Computer Science, Hubei University, Wuhan , China
Journal of Mathematical Chemistry Vol. 38, No. 3, October 005 ( 005) DOI: 0.007/s090-005-584-7 On the Randić index Huiqing Liu School of Mathematics and Computer Science, Hubei University, Wuhan 43006,
More informationSet-orderedness as a generalization of k-orderedness and cyclability
Set-orderedness as a generalization of k-orderedness and cyclability Keishi Ishii Kenta Ozeki National Institute of Informatics, Tokyo 101-8430, Japan e-mail: ozeki@nii.ac.jp Kiyoshi Yoshimoto Department
More informationGroup Colorability of Graphs
Group Colorability of Graphs Hong-Jian Lai, Xiankun Zhang Department of Mathematics West Virginia University, Morgantown, WV26505 July 10, 2004 Abstract Let G = (V, E) be a graph and A a non-trivial Abelian
More informationConnectivity of Cages
Connectivity of Cages H. L. Fu, 1,2 1 DEPARTMENT OF APPLIED MATHEMATICS NATIONAL CHIAO-TUNG UNIVERSITY HSIN-CHU, TAIWAN REPUBLIC OF CHINA K. C. Huang, 3 3 DEPARTMENT OF APPLIED MATHEMATICS PROVIDENCE UNIVERSITY,
More informationDownloaded 03/01/17 to Redistribution subject to SIAM license or copyright; see
SIAM J. DISCRETE MATH. Vol. 31, No. 1, pp. 335 382 c 2017 Society for Industrial and Applied Mathematics PARTITION CONSTRAINED COVERING OF A SYMMETRIC CROSSING SUPERMODULAR FUNCTION BY A GRAPH ATTILA BERNÁTH,
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 informationA characterization of diameter-2-critical graphs with no antihole of length four
Cent. Eur. J. Math. 10(3) 2012 1125-1132 DOI: 10.2478/s11533-012-0022-x Central European Journal of Mathematics A characterization of diameter-2-critical graphs with no antihole of length four Research
More informationARTICLE IN PRESS Theoretical Computer Science ( )
Theoretical Computer Science ( ) Contents lists available at ScienceDirect Theoretical Computer Science journal homepage: www.elsevier.com/locate/tcs Conditional matching preclusion for hypercube-like
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 informationDiscrete Mathematics
Discrete Mathematics 310 (2010) 3398 303 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: www.elsevier.com/locate/disc Maximal cliques in {P 2 P 3, C }-free graphs S.A.
More informationNowhere 0 mod p dominating sets in multigraphs
Nowhere 0 mod p dominating sets in multigraphs Raphael Yuster Department of Mathematics University of Haifa at Oranim Tivon 36006, Israel. e-mail: raphy@research.haifa.ac.il Abstract Let G be a graph with
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 informationAntoni Marczyk A NOTE ON ARBITRARILY VERTEX DECOMPOSABLE GRAPHS
Opuscula Mathematica Vol. 6 No. 1 006 Antoni Marczyk A NOTE ON ARBITRARILY VERTEX DECOMPOSABLE GRAPHS Abstract. A graph G of order n is said to be arbitrarily vertex decomposable if for each sequence (n
More informationHAMILTONIAN CYCLES AVOIDING SETS OF EDGES IN A GRAPH
HAMILTONIAN CYCLES AVOIDING SETS OF EDGES IN A GRAPH MICHAEL J. FERRARA, MICHAEL S. JACOBSON UNIVERSITY OF COLORADO DENVER DENVER, CO 8017 ANGELA HARRIS UNIVERSITY OF WISCONSIN-WHITEWATER WHITEWATER, WI
More informationGraphs and Combinatorics
Graphs and Combinatorics (2006) 22:241 249 Digital Object Identifier (DOI) 10.1007/s00373-006-0641-8 Graphs and Combinatorics Springer-Verlag 2006 On n-partite Tournaments with Unique n-cycle Gregory Gutin,
More informationarxiv: v2 [math.co] 7 Jan 2016
Global Cycle Properties in Locally Isometric Graphs arxiv:1506.03310v2 [math.co] 7 Jan 2016 Adam Borchert, Skylar Nicol, Ortrud R. Oellermann Department of Mathematics and Statistics University of Winnipeg,
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 informationSOME VARIANTS OF LAGRANGE S FOUR SQUARES THEOREM
Acta Arith. 183(018), no. 4, 339 36. SOME VARIANTS OF LAGRANGE S FOUR SQUARES THEOREM YU-CHEN SUN AND ZHI-WEI SUN Abstract. Lagrange s four squares theorem is a classical theorem in number theory. Recently,
More informationModern Algebra Lecture Notes: Rings and fields set 6, revision 2
Modern Algebra Lecture Notes: Rings and fields set 6, revision 2 Kevin Broughan University of Waikato, Hamilton, New Zealand May 20, 2010 Solving quadratic equations: traditional The procedure Work in
More informationOn Modular Colorings of Caterpillars
On Modular Colorings of Caterpillars Futaba Okamoto Mathematics Department University of Wisconsin - La Crosse La Crosse, WI 546 Ebrahim Salehi Department of Mathematical Sciences University of Nevada
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 informationRing Sums, Bridges and Fundamental Sets
1 Ring Sums Definition 1 Given two graphs G 1 = (V 1, E 1 ) and G 2 = (V 2, E 2 ) we define the ring sum G 1 G 2 = (V 1 V 2, (E 1 E 2 ) (E 1 E 2 )) with isolated points dropped. So an edge is in G 1 G
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 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 informationBichain graphs: geometric model and universal graphs
Bichain graphs: geometric model and universal graphs Robert Brignall a,1, Vadim V. Lozin b,, Juraj Stacho b, a Department of Mathematics and Statistics, The Open University, Milton Keynes MK7 6AA, United
More informationDisjoint Hamiltonian Cycles in Bipartite Graphs
Disjoint Hamiltonian Cycles in Bipartite Graphs Michael Ferrara 1, Ronald Gould 1, Gerard Tansey 1 Thor Whalen Abstract Let G = (X, Y ) be a bipartite graph and define σ (G) = min{d(x) + d(y) : xy / E(G),
More informationIntroduction to Domination Polynomial of a Graph
Introduction to Domination Polynomial of a Graph arxiv:0905.2251v1 [math.co] 14 May 2009 Saeid Alikhani a,b,1 and Yee-hock Peng b,c a Department of Mathematics Yazd University 89195-741, Yazd, Iran b Institute
More informationThe Restricted Edge-Connectivity of Kautz Undirected Graphs
The Restricted Edge-Connectivity of Kautz Undirected Graphs Ying-Mei Fan College of Mathematics and Information Science Guangxi University, Nanning, Guangxi, 530004, China Jun-Ming Xu Min Lü Department
More informationHAMBURGER BEITRÄGE ZUR MATHEMATIK
HAMBURGER BEITRÄGE ZUR MATHEMATIK Heft 243 On small contractible subgraphs in 3-connected graphs of small average degree Matthias Kriesell, Hamburg März 2006 On small contractible subgraphs in 3-connected
More informationF. Roussel, I. Rusu. Université d Orléans, L.I.F.O., B.P. 6759, Orléans Cedex 2, France
A linear algorithm to color i-triangulated graphs F. Roussel, I. Rusu Université d Orléans, L.I.F.O., B.P. 6759, 45067 Orléans Cedex 2, France Abstract: We show that i-triangulated graphs can be colored
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 informationApplied Mathematics Letters
Applied Mathematics Letters 23 (2010) 1295 1300 Contents lists available at ScienceDirect Applied Mathematics Letters journal homepage: www.elsevier.com/locate/aml The Roman domatic number of a graph S.M.
More informationPaths and cycles in extended and decomposable digraphs
Paths and cycles in extended and decomposable digraphs Jørgen Bang-Jensen Gregory Gutin Department of Mathematics and Computer Science Odense University, Denmark Abstract We consider digraphs called extended
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 informationDouble domination edge removal critical graphs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 48 (2010), Pages 285 299 Double domination edge removal critical graphs Soufiane Khelifi Laboratoire LMP2M, Bloc des laboratoires Université demédéa Quartier
More informationDegree Conditions for Spanning Brooms
Degree Conditions for Spanning Brooms Guantao Chen, Michael Ferrara, Zhiquan Hu, Michael Jacobson, and Huiqing Liu December 4, 01 Abstract A broom is a tree obtained by subdividing one edge of the star
More information