Set-orderedness as a generalization of k-orderedness and cyclability
|
|
- Meagan McKinney
- 6 years ago
- Views:
Transcription
1 Set-orderedness as a generalization of k-orderedness and cyclability Keishi Ishii Kenta Ozeki National Institute of Informatics, Tokyo , Japan ozeki@nii.ac.jp Kiyoshi Yoshimoto Department of Mathematics, Collage of Science and Technology Nihon University, Tokyo , Japan yosimoto@math.cst.nihon-u.ac.jp April 21, 2010 Abstract A graph G is called k-ordered if for any sequence of k distinct vertices of G, there exists a cycle in G through these vertices in the order. A vertex set S is called cyclable in G if there exists a cycle passing through all vertices of S. We will define set-orderedness which is a natural generalization of k-orderedness and cyclability. We also give a degree sum condition for graphs to satisfy set-orderedness. This is an extension of well-known sufficient conditions on k-orderedness. Keywords: k-ordered, cyclable, degree sum Research Fellow of the Japan Society for the Promotion of Science 1
2 1 Introduction A cycle-related property, for instance, a hamilton cycle have been studied for a long time, and as an extension of it, a cycle passing all specified vertices is also widely studied. Many researchers study this type cycle from two aspects; one of them is a cycle passing specified vertices in a given order, another is that without considering the order. The first one is the notion of k-orderedness, which was first introduced by Chartrand. A graph G is called k-ordered if for any sequence of k distinct vertices of G, there exists a cycle in G passing through these specified vertices in the order. The second one is the notion of cyclability. For any subset S of V (G), S is called cyclable in G if there exists a cycle through all vertices of S. Many results of these two concepts are known, see [4, 5, 6, 7, 8, 10, 11, 12, 13] for k-orderedness and [1, 3, 9, 14, 15] for cyclability. Note that k-orderedness is a stronger concept than cyclability. In this sense, there seems to exist a close relationship between these two concepts, however, this relationship was not studied. The purpose of this paper is to interpolate these concepts. In Section 2, we introduce a new concept set-orderedness, which is a natural generalization of k-orderedness. 2 Set-orderedness In this paper, we consider only finite undirected graphs without loops or multiple edges. For standard graph-theoretic terminology not explained in this paper, we refer the reader to [2]. The following result is a classical one on k-orderedness by Ng and Schultz. Note that they proved that the same condition as Theorem 1 guarantees the existence of a hamilton cycle passing through specified k vertices in the given order. Theorem 1 (Ng and Schultz [12]) Let G be a graph of order n 3 and let k be an integer with 3 k n. If d G (u)+d G (v) n +2k 6 for any two non-adjacent vertices u and v, then G is k-ordered. The bound of the degree condition was improved for small k with respect to n by Faudree et al. [6] 2
3 Theorem 2 (Faudree et al. [6]) Let k be an integer with 3 k n/2 and let G be a graph of order n. If d G (u)+d G (v) n +3(k 3)/2 for any two non-adjacent vertices u and v, then G is k-ordered. Let v 1,v 2,...,v k be k distinct vertices of G. A graph G is called (v 1,v 2,...,v k )- ordered if there exists a cycle containing these k vertices in this order. (See Figure 1 (i).) Definitely, a graph G is k-ordered if and only if G is (v 1,v 2,...,v k )-ordered for any distinct vertices v 1,v 2,...,v k. In order to show k-orderedness of a given graph, we need the degree sum condition for all non-adjacent vertices. because we must consider all combinations and orders of k distinct vertices. However, considering only given k vertices v 1,v 2,...,v k and a cycle through them in such a order, we may be able to restrict the vertices on which we must deal with the degree sum condition to the given k vertices. In fact, Ng and Schultz [12] found the degree sum condition on given k vertices which guarantees the existence of a path passing them in the given order. As a corollary of it, we obtain the following result. Theorem 3 Let G be a graph of order n 3 and let v 1,v 2,...,v k be k distinct vertices of G with k 3. If d(v i )+d(v i+1 ) n +2k 6 for any 1 i k (regarding v k+1 as v 1 ), then G is (v 1,v 2,...,v k )-ordered. While Theorem 2 shows that Theorem 1 is not sharp, the following example shows the sharpness of Theorem 3. Let k be even integer and n be an odd integer. Consider the graph G which is obtained from k vertices v 1, v 2,..., v k with all possible edges between them except for v i v i+1 for 1 i k by adding n k vertices and joining k 1 vertices of them to v 1,v 2,...,v k 1,v k, half of remaining n 2k + 1 vertices to v 1, v 3,..., v k 1 and another half to v 2, v 4,..., v k. As an extension of (v 1,v 2,...,v k )-orderedness, we will define the concept of setorderedness. In the concept of k-orderedness or (v 1,v 2,...,v k )-orderedness, we must find a cycle passing through the specified vertices in the prescribed order. In this sense, we consider a relaxation of cycles, that is, a cycle passes specified vertices in a partially desired order. Let S 1,S 2,...,S l be disjoint nonempty vertex sets in a graph G with l i=1 S i = k. A graph G is called (S 1,S 2,...,S l )-ordered if there exists a cycle in G through 3
4 all vertices of S 1 S 2 S l in the order, that is, any vertex of S j appears in the cycle after any vertex of S i if 1 i<j l. (See Figure 1 (ii).) v 2 S 1 v 1 v 4 v 3 S 2 v 5 S 3 (i) a (v 1,v 2,,v 5 )-ordered graph Figure 1: (ii) an (S 1,S 2,S 3 )-ordered graph By the definition of (S 1,S 2,...,S l )-orderedness, in case of l = k, (S 1,S 2,...,S l )- orderedness means (v 1,v 2,...,v k )-orderedness where S i = {v i } for 1 i l. On the other hand, in case of l =1,(S 1 )-orderedness is equivalent to cyclability of S 1. In this sense, the concept of (S 1,S 2,...,S l )-orderedness connects k-orderedness and cyclability. We define a path cover of G as a set of paths which are pairwise disjoint and contain all vertices of G. The path cover number, denoted by pc(g), is the minimum number of P among all path covers P of G. Let S V (G). For convenience, we call a path cover of S instead of a path cover of G[S] and denote pc(s) instead of pc(g[s]). Throughout this paper, the index i is always taken modulo l. Theorem 4 Let G be a graph on n vertices and l 2 and let S 1,S 2,...,S l be disjoint nonempty vertex sets. Let s i := S i, p i := pc(s i ), k := l i=1 s i, p := l i=1 p i, s i := j i,i+1 s j and p i := j i,i+1 p j. Suppose that for each i (1 i l), d G (u)+d G (v) n + k + p (s i + p i + l) for every pair of non-adjacent vertices u, v S i, and d G (u)+d G (v) n + s i + p i 2 ε i 4
5 for every pair of non-adjacent vertices u, v such that u S i and v S i+1, where 2 if l =2, 0 if l =3, 4, or if l 5 and s i 1 = s i+2 =1, ε i := 1 if l =5, 6 and at least one of s i 1 and s i+2 is at least 2, or if l 7 and exactly one of s i 1 and s i+2 is at least 2, 2 if l 7 and both s i 1 and s i+2 are at least 2. Then G is (S 1,S 2,...,S l )-ordered. Consider the case l = k 3. Then each S i consists of only one vertex, say v i, and hence we have s i = p i =1,s i = p i = k 2 and ε i = 0. Then we can not take any pair of non-adjacent vertices u i,v i S i because s i = 1, and hence the first degree condition is vacuous. The second degree condition in Theorem 4 is d(u)+d(v) n + s i + p i 2 ε i = n +2k 6 for all pair of non-adjacent vertices u S i and v S i+1. Therefore, we obtain theorem 3 as a corollary. In Section 3, we will prove Theorem 4, and in Section 4, we will explain the sharpness of Theorem 4. 3 Proofs Theorem 4 for the case l = 2 can be proved by the same argument as the case l 3, and hence we omit the proof. In this section, we only prove Theorem 4 for the case l 3. Throughout this section, the index j is also taken modulo l. Let S V (G). We call a path P an S-dense path if S V (P ) and V (P ) = S +pc(s) 1, that is, an S-dense path is a shortest possible path through S, given pc(s). Lemma 5 Let G be a graph of order n 3 and let S V (G). Ifd G (u)+d G (v) n 1 for every pair of non-adjacent vertices u, v S, then there exists an S-dense path P. 5
6 Proof of Lemma 5. Let P := {P 1,P 2,...,P l } be a path cover of S such that l =pc(s) and let u i and v i be the end-vertices of P i. Possibly u i = v i. We give an orientation to each path P i from u i to v i and write the oriented path P i by P i. In addition, the reverse orientation of P is denoted by P. Since P is a minimum path cover of S, u i u j,u i v j,v i v j E(G) for i j. Let T := V (G) l i=1 V (P i). Now we will show that N T (u i ) N T (v j ) l 1 for i j. Fix i and j with 1 i j l. Suppose that N Pi (u i ) N Pi (v j ), sayw N Pi (u i ) N Pi (v j ). Let P := v i Pi w + u i Pi wv j Pj u j. Then Q := {P h : h i, j} {P } is also a path cover of S with Q < P, contradicting the minimality of P. Thus, N Pi (u i ) N Pi (v j )=. Since N Pi (u i ) N Pi (v j ) V (P i ) {v i }, we have By symmetry of i and j, we obtain d Pi (u i )+d Pi (v j ) V (P i ) 1. (1) d Pj (u i )+d Pj (v j ) V (P j ) 1. (2) Next, suppose that N Ph (u i ) N Ph (v j ) for h i, j, sayw N Ph (u i ) N Ph (v j ). Let P := v i Pi u i w + Ph v h and P := u j Pj v j w P h u h. Then Q := {P t : t h, i, j} {P, P } is also a path cover of S, a contradiction. Thus, N Ph (u i ) N Ph (v j )=. Since N Ph (u i ) N Ph (v j ) V (P h ) {v h }, we have d Ph (u i )+d Ph (v j ) V (P h ) 1. (3) By the inequalities (1) (3), we reduce l ( dph (u i )+d Ph (v j ) ) l ( V (Ph ) 1 ) = h=1 h=1 h=1 l V (P h ) l. Then by the degree condition, ( l ) d T (u i )+d T (v j ) n 1 V (P h ) l = T + l 1, h=1 and hence N T (u i ) N T (v j ) l 1. Therefore, we can find l 1 distinct vertices w 1,w 2,...,w l 1 T such that w i N T (u i+1 ) N T (v i ) for 1 i l 1. Then P = u 1 P1 v 1 w 1 u 2 P2 v 2 w 2...w l 1 u l Pl v l is a path such that S V (P ) and V (P ) = l V (P h ) + l 1= S +pc(s) 1. h=1 6
7 For the proof of our main theorem, we need the following lemma. This follows from Lemma 5 by a straight forward induction on l. Lemma 6 Let G be a graph of order n 3 and let l 1. Let S 1,S 2,...,S l be disjoint nonempty vertex sets. Let s i := S i, p i := pc(s i ), k := l i=1 s i and p := l i=1 p i. Suppose that for each i (1 i l) and for every pari of non-adjacent vertices u, v S i, d G (u)+d G (v) n + k + p (s i + p i + l). There exist l disjoint paths P 1,P 2,...,P l such that P i is an S i -dense path for each 1 i l. Proof of Theorem 4. By Lemma 6, there exist l disjoint paths P 1,P 2,...,P l such that P i is an S i -dense path for each 1 i l. Let u i and v i be the end-vertices of P i and let T := V (G) l i=1 V (P i). Note that v i = u i if s i = 1. Now we will connect P i and P i+1. First, if v i and u i+1 are adjacent, then using the edge v i u i+1, we can join two paths P i and P i+1. We call this operation Operation 1 on (v i,u i+1 ). Next, suppose that v i and u i+1 are not adjacent and N T (v i ) N T (u i+1 ), say w i N T (v i ) N T (u i+1 ). If w i is not in use for other pairs, then we can connect v i and u i+1 by using w i. After connecting v i and u i+1, we obtain the path u i Pi v i w i u i+1pi+1 v i+1. We call this operation Operation 2 on (v i,u i+1 ). (See Figure 2.) P 1 P 2 P 3 P 4 u 1 v 1 u 2 v 2 u 3 v 3 u 4 v 4 Operation 1 w 2 Operation 2 Figure 2: Operations 1 and 2. By repeating Operations 1 and 2 for l i=1 P i, we obtain a cycle or a union of paths, denoted by P. Note that P i is contained in P as a subpath, and P i+1 lies on P next to P i if v i and u i+1 are connected by one of the operations. Let T := V (G) V (P ). If P is a cycle, then there is nothing to prove. Thus we may assume that there exists a pair (v i,u i+1 ) on which we can perform neither Operation 1 nor 2. Then v i u i+1 E(G) and N T (v i ) N T (u i+1 )=. We also give an orientation to P and for x V (P ), we define x + as the successor of x along P. Note that v + j := w j 7
8 if Operation 2 is performed on (v j,u j+1 ), and we define v + j := u j+1 even if neither Operation 1 nor 2 are performed on (v j,u j+1 ). Choose such dense paths P 1,P 2,...,P l, such a union P of paths, which is obtained by repeating Operations 1 and 2, and a pair (v i,u i+1 ) on which we can perform neither Operation 1 nor 2 so that (P1) Operation 1 is performed as many times as possible, (P2) Operation 2 is performed as many times as possible; subject to (P1). In addition to (P1) and (P2), we choose P 1,.., P l,p and (v i,u i+1 ) so that (P3) The number of performing Operation 2 on (v i 1,u i ) and (v i+1,u i+2 ) is as large as possible; subject to (P2). Without loss of generality, we may assume that i = l. Thus, u 1 v l E(G) and N T (u 1 ) N T (v l )=. Since N T (u 1 ) N T (v l )=, we have d T (u 1 )+d T (v l ) T. (4) Let Q 1 and Q l be parts of P from u 1 to u 2 and from v l 1 to v l, respectively. (See Figure 3.) Q 1 Q l P 1 P 2 P l 1 P l u 1 v 1 u 2 v 2 u l 1 v l 1 u l v l Figure 3: Q 1 and Q l. Claim 1 d Q1 (u 1 )+d Q1 (v l ) V (Q 1 ) and d Ql (u 1 )+d Ql (v l ) V (Q l ). Proof. Suppose that N Q1 (u 1 ) N Q1 (v l ), sayw N Q1 (u 1 ) N Q1 (v l ). Then we can replace Q l Q 1 with v l 1Ql v l w Q 1 u 1 w + Q1 u 2, contradicting the choice of P. Hence N Q1 (u 1 ) N Q1 (v l )=. This implies that d Q1 (u 1 )+d Q1 (v l ) V (Q 1 ). By considering the reverse orientation P, we have d Ql (u 1 )+d Ql (v l ) V (Q l ). 8
9 Let w j be the vertex connecting v j and u j+1 under Operation 2 on (v j,u j+1 ), if Operation 2 is performed on (v j,u j+1 ). Let W := {w j : Operation 2 is performed on (v j,u j+1 ), and j 1,l 1,l} and let η := W. Let P := P (Q 1 Q l ). Since V (P j ) = s j + p j 1, we have V (P ) = s l + p l l + η. (5) Let r := 2 V (P ) ( d P (u 1 )+d P (v l ) ) ε l. By the definition of ε l, note that r 2. The following claim holds. Claim 2 l 3 η l 2+r. In particular, r 1. Proof. It is clear that l 3 η by the definition of η. Suppose that η l 3+r. Then by (4), (5) and Claim 1, we have d G (u 1 )+d G (v l ) = d T (u 1 )+d T (v l )+d Q1 (u 1 )+d Q1 (v l ) +d Ql (u 1 )+d Ql (v l )+d P (u 1 )+d P (v l ) T + V (Q 1 ) + V (Q l ) +2 V (P ) r ε l = n + V (P ) r ε l = n + s l + p l l + η r ε l n + s l + p l 2 ε l 1, a contradiction. Thus, η l 2+r. Moreover, since η l 3, we have l 3 l 2+r, or r 1. Since 2 V (P ) d P (u 1 )+d P (v l ), we have r ε l. Therefore by Claim 2, the case ε l = 0 is done. Thus, we may assume that ε l 1, in particular, l 5. We also have the following claim. The proof of them is obvious, and hence we leave it to the reader. Claim 3 (i) If v 2 N G (u 1 ), then Operation 1 is performed on at least one of the pairs (v 1,u 2 ) and (v 2,u 3 ). (i) If u l 1 N G (v l ), then Operation 1 is performed on at least one of the pairs (v l 2,u l 1 ) and (v l 1,u l ). 9
10 We divide the rest of the proof into three cases. Case 1. v 2 N G (u 1 ) and u l 1 N G (v l ). If s 2 2, then v 2 V (P ), and if s l 1 2, then u l 1 V (P ). Thus, by the definition of ε l, we have d P (u 1 )+d P (v l ) 2 V (P ) ε l. This implies that r 0, contradicting Claim 2. Case 2. v 2 N G (u 1 ) and u l 1 N G (v l ), or v 2 N G (u 1 ) and u l 1 N G (v l ). By symmetry, we may assume that v 2 N G (u 1 ) and u l 1 N G (v l ). Then u l 1 N G (v l ) implies that d P (u 1 )+d P (v l ) 2 V (P ) 1orε l = 1. In each case, we have r 1, and hence r = 1 and η = l 3 by Claim 2. Since η = l 3, Operation 2 is performed on (v j,u j+1 ) for every 2 j l 2. By Claim 3 (i), Operation 1 is performed on (v 1,u 2 ). Suppose that w l 2 N G (u 1 ) N G (v l ). Then using w l 2 in order to connect between u 1 and v l, we can take a union of paths P {v l 2 w l 2,w l 2 u l 1 } {u 1 w l 2,w l 2 v l }, contradicting the choice (P3), because Operation 1 is performed on (v 1,u 2 ) and Operation 2 is performed on (v l 3,u l 2 ). (See Figure 4.) Thus, we obtain w l 2 N(u 1 ) N(v l ), and this implies that d P (u 1 )+d P (v l ) 2 V (P ) 2, or d P (u 1 )+d P (v l ) 2 V (P ) 1 and ε l = 1. Then r 0, which contradicts Claim 2. P 1 P 2 P l 2 P l 1 P 1 v l 3 u 1 v 1 u 2 v 2 u l 2 v l 2 u l 1 v l 1 w l 2 w l 1 u l v l w l 3 P 1 u 1 v 1 P 2 P l 2 P l 1 P 1 v l u 2 v 2 v l 3 u l 2 v l 2 u l 1 w l 1 v l 1 u l w l 3 w l 2 Figure 4: Case 3. v 2 N G (u 1 ) and u l 1 N G (v l ). Case 3.1. l 7. Since r 2, we have η l 4 by Claim 2. Therefore on at least one of the pairs (v 2,u 3 ) and (v l 2,u l 1 ), Operation 2 is performed. By symmetry, we may assume 10
11 that Operation 2 is performed on (v 2,u 3 ). This implies that on (v 1,u 2 ), Operation 1 is performed by Claim 3 (i). Suppose that Operation 1 is not performed on (v l 2,u l 1 ). Then on (v l 1,u l ), Operation 1 is also performed, by Claim 3 (ii). Since η l 4 and l 7, there exist consecutive pairs (v j,u j+1 ) and (v j+1,u j+2 ) such that Operation 2 is performed on both pairs. If w j N G (u 1 ) N G (v l ), then we can change P with P {v j 1 w j,w j u j } {v l w j,w j u 1 }, which contradicts the choice (P3), because Operation 1 is performed on both (v 1,u 2 ) and (v l 1,u l ). Thus, w j N G (u 1 ) N G (v l ) and by symmetry, w j+1 N G (u 1 ) N G (v l ). Therefore d P (u 1 )+d P (v l ) 2 V (P ) 2, and hence r 0, which contradicting Claim 2. Thus we may assume that Operation 1 is performed on (v l 2,u l 1 ). Then η = l 4. This implies that for any 2 j l 3, Operation 2 is performed on (v j,u j+1 ). Since η = l 4 3, there exist three consecutive pairs (v j 1,u j ), (v j,u j+1 ) and (v j+1,u j+2 ) such that Operation 2 is performed on every pair. By the same argument as above, w j N G (u 1 ) N G (v l ). Therefore d P (u 1 )+d P (v l ) 2 V (P ) 1, and hence r 1. This contradicts Claim 2 together with η = l 4. Case 3.2. l =5orl =6. In these cases, note that ε l = 1. Therefore r = 1 and η = l 3, by the definition of η and Claim 2. This implies that on both (v 2,u 3 ) and (v l 2,u l 1 ), Operation 2 is performed. Then by Claims 3 (i) and (ii), Operation 1 is performed on both (v 1,u 2 ) and (v l 1,u l ). Moreover since η = l 3, we can find consecutive pairs (v j,u j+1 ) and (v j+1,u j+2 ) such that Operation 2 is performed on both pairs. By the same argument as Case 3.1, w j,w j+1 N G (u 1 ) N G (v l ) and hence d P (u 1 )+d P (v l ) 2 V (P ) 2, a contradiction again. 4 Examples In this section, we will show that almost all of degree sum conditions of Theorem 4 are best possible. (In Examples 1 and 6, the orders of the graph G 1 and G 2 depend on the cardinalities of specified vertices.) Throughout this section, we use S 1, S 2,..., S l as disjoint vertex sets with S i = s i and l i=1 s i = k. The first example shows that the first degree sum condition of Theorem 4 is best possible. 11
12 Example 1: Let S 1, S 2,..., S l be partite sets of some complete l-partite graph. We construct a graph G 1 by adding (k l 1) new vertices and joining them to all vertices of S 1... S l. Then p i = s i for all i and k = p. Note that the second degree condition is vacuously true. We need l ( i=1 si 1 ) = k l vertices to obtain l disjoint paths such that the i-th path has all vertices of S i. Thus, G 1 is not (S 1,S 2,...,S l )-ordered. On the other hand, for every i with 1 i l for every pair of non-adjacent vertices u, v S i, d G1 (u)+d G1 (v) = 2 ( ) V (G 1 ) s i = V (G 1 ) + ( 2k l 1 ) 2s i = V (G 1 ) + k + p ( s i + p i + l ) 1, and hence we cannot decrease the value of the first degree sum condition without breaking the conclusion. Next we will show that the lower bound of the second condition of Theorem 4 is also sharp. In order to show that, we have to consider some cases depending on the value of l. Note that in Examples 2 5, the first degree sum condition is vacuously true. Example 2: Let l = 3 and let S i be disjoint cliques for 1 i 3. We connect every vertex of S i and every vertex of S i+1 for i =1, 2. Moreover, we add (n k) new vertices and join some of them to S 1 S 2 and others to S 2 S 3. Let G 2 be a graph obtained by above construction. Then V (G 2 ) = n and p i = 1 for any 1 i 3. Since we cannot pass a vertex of S 1 after a vertex of S 3 without passing a vertex of S 2, G 2 is not (S 1,S 2,S 3 )-ordered. On the other hand, for every pair of u S 1 and v S 3, d G2 (u)+d G2 (v) = (s 1 1+s 2 )+(s 2 + s 3 1) + (n k) = n + k s 1 s 3 2 = V (G 2 ) + s 3 + p 3 2 ε i 1, and hence when l = 3, we cannot decrease the value of ε i. Example 3: Let l = 4 and let S i be disjoint cliques for 1 i 4. We connect all pairs of S i and S j except for S 1 and S 4, and S 2 and S 3. Moreover, we add n k new 12
13 vertices and join one vertex of them to 4 i=1 S i, some of others to S 1 S 2, and the remaining vertices to S 3 S 4. Let G 3 be a graph obtained by above construction. Then V (G 3 ) = n and p i = 1 for any 1 i 4. Since we can use only one vertex to connect S 2 and S 3,orS 4 and S 1, G 3 is not (S 1,S 2,S 3,S 4 )-ordered. On the other hand, for every pair of u S 1 and v S 4, d G3 (u)+d G3 (v) = (k s 4 1+1)+(k s 1 1+1)+(n k 1) = n + k s 1 s 4 1 = V (G 3 ) + s 4 + p 4 2 ε 4 1, and hence when l = 4, we cannot decrease the value of ε i. Example 4: Let l = 5 and let S i be disjoint cliques for 1 i 5 with s 4 2 or s 2 2. We connect all pairs of S i and S j except for S 1 and S 5, and S 3 and S 4. Moreover, we add new n k vertices and join one vertex of them to 5 i=1 S i, some of others to S 1 S 2 S 3, and the remaining vertices to S 2 S 4 S 5. Let G 4 be a graph obtained by above construction. Then V (G 4 ) = n and p i = 1 for any 1 i 5. By the same reason as G 3, G 4 is not (S 1,...,S 5 )-ordered. On the other hand, for every pair of u S 1 and v S 5, d G4 (u)+d G4 (v) = (k s 5 1+1)+(k s 1 1+1)+(n k 1) = n + k s 1 s 5 1 = V (G 4 ) + s 5 + p 5 2 ε 5 1, and hence when l = 5, and s i 1 2ors i+2 2, we cannot decrease the value of ε i. Example 5: Let l = 6 and let S i be disjoint cliques for 1 i 6 with s 5 2or s 2 2. We connect all pairs of S i and S j except for S 1 and S 6, S 2 and S 3, and S 4 and S 5. We add n k new vertices, and join two vertices of them to 6 i=1 S i, some of others to S 1 S 3 S 5, and the remaining vertices to S 2 S 4 S 6. Let G 5 be a graph obtained by above construction. Then V (G 5 ) = n and p i = 1 for any 1 i 6. Again, G 5 is not (S 1,...,S 6 )-ordered, and for every pair of u S 1 and v S 6, d G5 (u)+d G5 (v) = (k s 6 1+2)+(k s 1 1+2)+(n k 2) = n + k s 1 s 6 = V (G 5 ) + s 6 + p 6 2 ε 6 1, 13
14 and hence when l = 6, and s i 1 2ors i+2 2, we cannot decrease the value of ε i. Example 6: Let l 7 and s i =2ors i = 3 for all 1 i l. We define H i as a path u i u i v i if s i = 3, and in case of s i = 2, define H i as an edge u i v i. By connecting all pairs of vertices in H i and H j, and removing 4l edges {u i u i+1,u i v i+1,v i u i+1,v i v i+1 :1 i l}, we obtain a graph H. Then by adding (l 1) new vertices to a graph H and joining them to all other vertices, we construct a graph G 6. Then V (G 6 ) = k+l 1, p i = 1 and p i = l 2 for any 1 i l. Because at least one vertex not in S i is necessary to connect S i and S i+1, G 6 is not (S 1,...,S l )-ordered, and for every pair of u i S i and v i+1 S i+1, ( ) ( ) d G6 (u i )+d G6 (v i+1 ) = k s i 4+1+l 1 + k s i l 1 = n + k s i s i+1 + p 7 = V (G 6 ) + s 6 + p 6 2 ε 6 1. Hence when s i =2ors i = 3 for all 1 i l, we cannot decrease the value of ε i. Acknowledgements The authors would like to thank the referees for the careful reading and useful suggestions. References [1] B. Bollobás and G. Brightwell, Cycles through specified vertices, Combinatorica 13 (1993) [2] J.A. Bondy, Basic graph theory - paths and circuits, Handbook of Combinatorics, Vol. I, Elsevier, Amsterdam (1995) [3] H.J. Broersma, H. Li, J. Li, F. Tian and H.J. Veldman, Cycles through subsets with large degree sums, Discrete Math. 171 (1997) [4] R.J. Faudree, Survey of results on k-ordered graphs, Discrete Math. 229 (2001) [5] J.R. Faudree and R.J. Faudree, Forbidden subgraphs that imply k-ordered and k-ordered hamiltonian, Discrete Math. 243 (2002)
15 [6] R.J. Faudree, R.J. Gould, A.V. Kostochka, L. Lesniak, I. Schiermeyer and A. Saito, Degree conditions for k-ordered hamiltonian graphs, J. Graph Theory 42 (2003) [7] J.R. Faudree, R.J. Gould, F. Pfender and A. Wolf, On k-ordered bipartite graphs, Electron. J. Combin. 10 (2003) R [8] W. Goddard, Minimum degree conditions for cycles including specified sets of vertices, Graphs and Combin. 20 (2004) [9] A. Harkat-Benhamdine, H. Li and F. Tian, Cyclability of 3-connected graphs, J. Graph Theory 34 (2000) [10] Z. Hu and F. Tian, On k-ordered graphs involved degree sum, Acta Math. Appl. Sin. Engl. Ser. 19 (2003) [11] H.A. Kierstead, G.N. Sárközy and S.M. Selkow, On k-ordered hamiltonian graphs, J. Graph Theory 32 (1999) [12] L. Ng and M. Schultz, k-ordered hamiltonian graphs, J. Graph Theory 24 (1997) [13] E.W. Nicholson and B. Wei, Long cycles containing k-ordered vertices in graphs, Discrete Math. 308 (2008) [14] K. Ota, Cycles through prescribed vertices with large degree sum, Discrete Math. 145 (1995) [15] R.H. Shi, 2-neighborhoods and hamiltonian conditions, J. Graph Theory 16 (1992)
An 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 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 informationA necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees
A necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees Yoshimi Egawa Department of Mathematical Information Science, Tokyo University of
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 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 informationGraphs with large maximum degree containing no odd cycles of a given length
Graphs with large maximum degree containing no odd cycles of a given length Paul Balister Béla Bollobás Oliver Riordan Richard H. Schelp October 7, 2002 Abstract Let us write f(n, ; C 2k+1 ) for the maximal
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 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 informationHAMILTONICITY AND FORBIDDEN SUBGRAPHS IN 4-CONNECTED GRAPHS
HAMILTONICITY AND FORBIDDEN SUBGRAPHS IN 4-CONNECTED GRAPHS FLORIAN PFENDER Abstract. Let T be the line graph of the unique tree F on 8 vertices with degree sequence (3, 3, 3,,,,, ), i.e. T is a chain
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 informationPartitioning 2-edge-colored Ore-type graphs by monochromatic cycles
Partitioning 2-edge-colored Ore-type graphs by monochromatic cycles János Barát MTA-ELTE Geometric and Algebraic Combinatorics Research Group barat@cs.elte.hu and Gábor N. Sárközy Alfréd Rényi Institute
More informationCYCLE STRUCTURES IN GRAPHS. Angela K. Harris. A thesis submitted to the. University of Colorado Denver. in partial fulfillment
CYCLE STRUCTURES IN GRAPHS by Angela K. Harris Master of Science, University of South Alabama, 003 A thesis submitted to the University of Colorado Denver in partial fulfillment of the requirements for
More informationCycle Spectra of Hamiltonian Graphs
Cycle Spectra of Hamiltonian Graphs Kevin G. Milans, Dieter Rautenbach, Friedrich Regen, and Douglas B. West July, 0 Abstract We prove that every graph consisting of a spanning cycle plus p chords has
More informationThe Turán number of sparse spanning graphs
The Turán number of sparse spanning graphs Noga Alon Raphael Yuster Abstract For a graph H, the extremal number ex(n, H) is the maximum number of edges in a graph of order n not containing a subgraph isomorphic
More informationEven Cycles in Hypergraphs.
Even Cycles in Hypergraphs. Alexandr Kostochka Jacques Verstraëte Abstract A cycle in a hypergraph A is an alternating cyclic sequence A 0, v 0, A 1, v 1,..., A k 1, v k 1, A 0 of distinct edges A i and
More informationSpanning 2-trails from degree sum conditions
This is a preprint of an article accepted for publication in the Journal of Graph Theory c 2004(?) (copyright owner as specified in the Journal) Spanning 2-trails from degree sum conditions M. N. Ellingham
More informationImproved degree conditions for 2-factors with k cycles in hamiltonian graphs
Improved degree conditions for -factors with k cycles in hamiltonian graphs Louis DeBiasio 1,4, Michael Ferrara,, Timothy Morris, December 4, 01 Abstract In this paper, we consider conditions that ensure
More informationCycle lengths in sparse graphs
Cycle lengths in sparse graphs Benny Sudakov Jacques Verstraëte Abstract Let C(G) denote the set of lengths of cycles in a graph G. In the first part of this paper, we study the minimum possible value
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 informationEdge Disjoint Cycles Through Specified Vertices
Edge Disjoint Cycles Through Specified Vertices Luis Goddyn Ladislav Stacho Department of Mathematics Simon Fraser University, Burnaby, BC, Canada goddyn@math.sfu.ca, lstacho@math.sfu.ca February 16, 2005
More informationPartial characterizations of clique-perfect graphs II: diamond-free and Helly circular-arc graphs
Partial characterizations of clique-perfect graphs II: diamond-free and Helly circular-arc graphs Flavia Bonomo a,1, Maria Chudnovsky b,2 and Guillermo Durán c,3 a Departamento de Matemática, Facultad
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 informationLine Graphs and Forbidden Induced Subgraphs
Line Graphs and Forbidden Induced Subgraphs Hong-Jian Lai and Ľubomír Šoltés Department of Mathematics West Virginia University, Morgantown, WV 26506-6310 July 14, 2002 Abstract Beineke and Robertson independently
More informationMinimal Paths and Cycles in Set Systems
Minimal Paths and Cycles in Set Systems Dhruv Mubayi Jacques Verstraëte July 9, 006 Abstract A minimal k-cycle is a family of sets A 0,..., A k 1 for which A i A j if and only if i = j or i and j are consecutive
More informationCYCLES OF GIVEN SIZE IN A DENSE GRAPH
CYCLES OF GIVEN SIZE IN A DENSE GRAPH DANIEL J. HARVEY DAVID R. WOOD Abstract. We generalise a result of Corrádi and Hajnal and show that every graph with average degree at least 4 kr contains k vertex
More informationA shorter proof of Thomassen s theorem on Tutte paths in plane graphs
A shorter proof of Thomassen s theorem on Tutte paths in plane graphs Kenta Ozeki National Institute of Informatics, 2-1-2 Hitotsubashi, Chiyoda-ku, Tokyo 101-8430, Japan and JST, ERATO, Kawarabayashi
More informationA note on Gallai-Ramsey number of even wheels
A note on Gallai-Ramsey number of even wheels Zi-Xia Song a, Bing Wei b, Fangfang Zhang c,a, and Qinghong Zhao b a Department of Mathematics, University of Central Florida, Orlando, FL 32816, USA b Department
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 informationExtremal Graphs Having No Stable Cutsets
Extremal Graphs Having No Stable Cutsets Van Bang Le Institut für Informatik Universität Rostock Rostock, Germany le@informatik.uni-rostock.de Florian Pfender Department of Mathematics and Statistics University
More informationPartitioning a graph into highly connected subgraphs
Partitioning a graph into highly connected subgraphs Valentin Borozan 1,5, Michael Ferrara, Shinya Fujita 3 Michitaka Furuya 4, Yannis Manoussakis 5, Narayanan N 5,6 and Derrick Stolee 7 Abstract Given
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 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 informationGallai-Ramsey numbers for a class of graphs with five vertices arxiv: v1 [math.co] 15 Nov 2018
Gallai-Ramsey numbers for a class of graphs with five vertices arxiv:1811.06134v1 [math.co] 15 Nov 018 Xihe Li a,b and Ligong Wang a,b, a Department of Applied Mathematics, School of Science, Northwestern
More informationParity Versions of 2-Connectedness
Parity Versions of 2-Connectedness C. Little Institute of Fundamental Sciences Massey University Palmerston North, New Zealand c.little@massey.ac.nz A. Vince Department of Mathematics University of Florida
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 informationA Note on Total Excess of Spanning Trees
A Note on Total Excess of Spanning Trees Yukichika Ohnishi Katsuhiro Ota Department of Mathematics, Keio University Hiyoshi, Kohoku-ku, Yokohama, 3-85 Japan and Kenta Ozeki National Institute of Informatics
More informationarxiv: v1 [math.co] 28 Oct 2015
Noname manuscript No. (will be inserted by the editor) A note on the Ramsey number of even wheels versus stars Sh. Haghi H. R. Maimani arxiv:1510.08488v1 [math.co] 28 Oct 2015 Received: date / Accepted:
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 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 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 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 informationDecomposing planar cubic graphs
Decomposing planar cubic graphs Arthur Hoffmann-Ostenhof Tomáš Kaiser Kenta Ozeki Abstract The 3-Decomposition Conjecture states that every connected cubic graph can be decomposed into a spanning tree,
More informationSome Nordhaus-Gaddum-type Results
Some Nordhaus-Gaddum-type Results Wayne Goddard Department of Mathematics Massachusetts Institute of Technology Cambridge, USA Michael A. Henning Department of Mathematics University of Natal Pietermaritzburg,
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 informationNowhere-zero Unoriented Flows in Hamiltonian Graphs
Nowhere-zero Unoriented Flows in Hamiltonian Graphs S. Akbari 1,5, A. Daemi 2, O. Hatami 1, A. Javanmard 3, A. Mehrabian 4 1 Department of Mathematical Sciences Sharif University of Technology Tehran,
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 informationUniversity of Twente. Faculty of Mathematical Sciences. Toughness and hamiltonicity in k-trees. University for Technical and Social Sciences
Faculty of Mathematical Sciences University of Twente University for Technical and Social Sciences P.O. Box 17 7500 AE Enschede The Netherlands Phone: +31-53-4893400 Fax: +31-53-4893114 Email: memo@math.utwente.nl
More informationNote on Vertex-Disjoint Cycles
Note on Vertex-Disjoint Cycles Jacques Verstraëte Department of Pure Mathematics and Mathematical Statistics Centre for Mathematical Sciences Wilberforce Road, Cambridge CB3 OWB England. November 999.
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 informationPancyclicity 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 informationarxiv: v1 [math.co] 20 Oct 2018
Total mixed domination in graphs 1 Farshad Kazemnejad, 2 Adel P. Kazemi and 3 Somayeh Moradi 1,2 Department of Mathematics, University of Mohaghegh Ardabili, P.O. Box 5619911367, Ardabil, Iran. 1 Email:
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 informationHamilton-Connected Indices of Graphs
Hamilton-Connected Indices of Graphs Zhi-Hong Chen, Hong-Jian Lai, Liming Xiong, Huiya Yan and Mingquan Zhan Abstract Let G be an undirected graph that is neither a path nor a cycle. Clark and Wormald
More informationPacking of Rigid Spanning Subgraphs and Spanning Trees
Packing of Rigid Spanning Subgraphs and Spanning Trees Joseph Cheriyan Olivier Durand de Gevigney Zoltán Szigeti December 14, 2011 Abstract We prove that every 6k + 2l, 2k-connected simple graph contains
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 informationK 4 -free graphs with no odd holes
K 4 -free graphs with no odd holes Maria Chudnovsky 1 Columbia University, New York NY 10027 Neil Robertson 2 Ohio State University, Columbus, Ohio 43210 Paul Seymour 3 Princeton University, Princeton
More informationHamilton cycles and closed trails in iterated line graphs
Hamilton cycles and closed trails in iterated line graphs Paul A. Catlin, Department of Mathematics Wayne State University, Detroit MI 48202 USA Iqbalunnisa, Ramanujan Institute University of Madras, Madras
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 informationObservation 4.1 G has a proper separation of order 0 if and only if G is disconnected.
4 Connectivity 2-connectivity Separation: A separation of G of order k is a pair of subgraphs (H, K) with H K = G and E(H K) = and V (H) V (K) = k. Such a separation is proper if V (H) \ V (K) and V (K)
More informationToughness and prism-hamiltonicity of P 4 -free graphs
Toughness and prism-hamiltonicity of P 4 -free graphs M. N. Ellingham Pouria Salehi Nowbandegani Songling Shan Department of Mathematics, 1326 Stevenson Center, Vanderbilt University, Nashville, TN 37240
More informationCographs; chordal graphs and tree decompositions
Cographs; chordal graphs and tree decompositions Zdeněk Dvořák September 14, 2015 Let us now proceed with some more interesting graph classes closed on induced subgraphs. 1 Cographs The class of cographs
More informationStability of the path-path Ramsey number
Worcester Polytechnic Institute Digital WPI Computer Science Faculty Publications Department of Computer Science 9-12-2008 Stability of the path-path Ramsey number András Gyárfás Computer and Automation
More informationOn the Pósa-Seymour Conjecture
On the Pósa-Seymour Conjecture János Komlós, 1 Gábor N. Sárközy, 2 and Endre Szemerédi 3 1 DEPT. OF MATHEMATICS, RUTGERS UNIVERSITY, NEW BRUNSWICK, NJ 08903 2 DEPT. OF COMPUTER SCIENCE, WORCESTER POLYTECHNIC
More informationOn Some Three-Color Ramsey Numbers for Paths
On Some Three-Color Ramsey Numbers for Paths Janusz Dybizbański, Tomasz Dzido Institute of Informatics, University of Gdańsk Wita Stwosza 57, 80-952 Gdańsk, Poland {jdybiz,tdz}@inf.ug.edu.pl and Stanis
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 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 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: v2 [math.co] 29 Oct 2017
arxiv:1404.3385v2 [math.co] 29 Oct 2017 A proof for a conjecture of Gyárfás, Lehel, Sárközy and Schelp on Berge-cycles G.R. Omidi Department of Mathematical Sciences, Isfahan University of Technology,
More informationEquitable 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 informationRao s degree sequence conjecture
Rao s degree sequence conjecture Maria Chudnovsky 1 Columbia University, New York, NY 10027 Paul Seymour 2 Princeton University, Princeton, NJ 08544 July 31, 2009; revised December 10, 2013 1 Supported
More informationTree-width and planar minors
Tree-width and planar minors Alexander Leaf and Paul Seymour 1 Princeton University, Princeton, NJ 08544 May 22, 2012; revised March 18, 2014 1 Supported by ONR grant N00014-10-1-0680 and NSF grant DMS-0901075.
More informationDiscrete Mathematics. The edge spectrum of the saturation number for small paths
Discrete Mathematics 31 (01) 68 689 Contents lists available at SciVerse ScienceDirect Discrete Mathematics journal homepage: www.elsevier.com/locate/disc The edge spectrum of the saturation number for
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 informationInduced subgraphs of graphs with large chromatic number. III. Long holes
Induced subgraphs of graphs with large chromatic number. III. Long holes Maria Chudnovsky 1 Princeton University, Princeton, NJ 08544, USA Alex Scott Mathematical Institute, University of Oxford, Oxford
More informationTHE STRUCTURE AND EXISTENCE OF 2-FACTORS IN ITERATED LINE GRAPHS
Discussiones Mathematicae Graph Theory 27 (2007) 507 526 THE STRUCTURE AND EXISTENCE OF 2-FACTORS IN ITERATED LINE GRAPHS Michael Ferrara Department of Theoretical and Applied Mathematics The University
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 informationPlanar Ramsey Numbers for Small Graphs
Planar Ramsey Numbers for Small Graphs Andrzej Dudek Department of Mathematics and Computer Science Emory University Atlanta, GA 30322, USA Andrzej Ruciński Faculty of Mathematics and Computer Science
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 informationON DOMINATING THE CARTESIAN PRODUCT OF A GRAPH AND K 2. Bert L. Hartnell
Discussiones Mathematicae Graph Theory 24 (2004 ) 389 402 ON DOMINATING THE CARTESIAN PRODUCT OF A GRAPH AND K 2 Bert L. Hartnell Saint Mary s University Halifax, Nova Scotia, Canada B3H 3C3 e-mail: bert.hartnell@smu.ca
More informationAn approximate version of Hadwiger s conjecture for claw-free graphs
An approximate version of Hadwiger s conjecture for claw-free graphs Maria Chudnovsky Columbia University, New York, NY 10027, USA and Alexandra Ovetsky Fradkin Princeton University, Princeton, NJ 08544,
More informationGeneralized Pigeonhole Properties of Graphs and Oriented Graphs
Europ. J. Combinatorics (2002) 23, 257 274 doi:10.1006/eujc.2002.0574 Available online at http://www.idealibrary.com on Generalized Pigeonhole Properties of Graphs and Oriented Graphs ANTHONY BONATO, PETER
More informationPartitioning a graph into highly connected subgraphs
Partitioning a graph into highly connected subgraphs Valentin Borozan 1,5, Michael Ferrara, Shinya Fujita 3 Michitaka Furuya 4, Yannis Manoussakis 5, Narayanan N 6 and Derrick Stolee 7 Abstract Given k
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 informationDecompositions of graphs into cycles with chords
Decompositions of graphs into cycles with chords Paul Balister Hao Li Richard Schelp May 22, 2017 In memory of Dick Schelp, who passed away shortly after the submission of this paper Abstract We show that
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 informationInduced subgraphs of graphs with large chromatic number. IX. Rainbow paths
Induced subgraphs of graphs with large chromatic number. IX. Rainbow paths Alex Scott Oxford University, Oxford, UK Paul Seymour 1 Princeton University, Princeton, NJ 08544, USA January 20, 2017; revised
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 informationHamiltonian claw-free graphs
Hamiltonian claw-free graphs Hong-Jian Lai, Yehong Shao, Ju Zhou and Hehui Wu August 30, 2005 Abstract A graph is claw-free if it does not have an induced subgraph isomorphic to a K 1,3. In this paper,
More informationarxiv: v1 [math.co] 23 Nov 2015
arxiv:1511.07306v1 [math.co] 23 Nov 2015 RAMSEY NUMBERS OF TREES AND UNICYCLIC GRAPHS VERSUS FANS MATTHEW BRENNAN Abstract. The generalized Ramsey number R(H, K) is the smallest positive integer n such
More informationA well-quasi-order for tournaments
A well-quasi-order for tournaments Maria Chudnovsky 1 Columbia University, New York, NY 10027 Paul Seymour 2 Princeton University, Princeton, NJ 08544 June 12, 2009; revised April 19, 2011 1 Supported
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 informationBetter bounds for k-partitions of graphs
Better bounds for -partitions of graphs Baogang Xu School of Mathematics, Nanjing Normal University 1 Wenyuan Road, Yadong New District, Nanjing, 1006, China Email: baogxu@njnu.edu.cn Xingxing Yu School
More informationarxiv: v1 [cs.ds] 2 Oct 2018
Contracting to a Longest Path in H-Free Graphs Walter Kern 1 and Daniël Paulusma 2 1 Department of Applied Mathematics, University of Twente, The Netherlands w.kern@twente.nl 2 Department of Computer Science,
More informationColoring Vertices and Edges of a Path by Nonempty Subsets of a Set
Coloring Vertices and Edges of a Path by Nonempty Subsets of a Set P.N. Balister E. Győri R.H. Schelp April 28, 28 Abstract A graph G is strongly set colorable if V (G) E(G) can be assigned distinct nonempty
More informationAn upper bound on the domination number of n-vertex connected cubic graphs
Discrete Mathematics 309 (2009) 1142 1162 www.elsevier.com/locate/disc An upper bound on the domination number of n-vertex connected cubic graphs A.V. Kostochka a,b,, B.Y. Stodolsky a a Department of Mathematics,
More informationDECOMPOSITIONS OF MULTIGRAPHS INTO PARTS WITH THE SAME SIZE
Discussiones Mathematicae Graph Theory 30 (2010 ) 335 347 DECOMPOSITIONS OF MULTIGRAPHS INTO PARTS WITH THE SAME SIZE Jaroslav Ivančo Institute of Mathematics P.J. Šafári University, Jesenná 5 SK-041 54
More informationSEMI-STRONG SPLIT DOMINATION IN GRAPHS. Communicated by Mehdi Alaeiyan. 1. Introduction
Transactions on Combinatorics ISSN (print): 2251-8657, ISSN (on-line): 2251-8665 Vol. 3 No. 2 (2014), pp. 51-63. c 2014 University of Isfahan www.combinatorics.ir www.ui.ac.ir SEMI-STRONG SPLIT DOMINATION
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 informationObservation 4.1 G has a proper separation of order 0 if and only if G is disconnected.
4 Connectivity 2-connectivity Separation: A separation of G of order k is a pair of subgraphs (H 1, H 2 ) so that H 1 H 2 = G E(H 1 ) E(H 2 ) = V (H 1 ) V (H 2 ) = k Such a separation is proper if V (H
More informationHamiltonian properties of 3-connected {claw,hourglass}-free graphs
Hamiltonian properties of 3-connected {claw,hourglass}-free graphs Zdeněk Ryjáček 1,3,5 Petr Vrána 1,3,5 Liming Xiong 2,4,6 November 10, 2017 Abstract We show that some sufficient conditions for hamiltonian
More information