DENSE ARBITRARILY PARTITIONABLE GRAPHS
|
|
- Muriel Warren
- 5 years ago
- Views:
Transcription
1 Discussiones Mathematicae Graph Theory 36 (016 5 doi: /dmgt.1833 DENSE ARBITRARILY PARTITIONABLE GRAPHS Rafa l Kalinowski 1, Monika Pilśniak 1, Ingo Schiermeyer 1, and Mariusz Woźniak 1 1 AGH University of Science and Technology Kraków, Poland TU Bergakademie Freiberg Freiberg, Germany kalinows@agh.edu.pl pilsniak@agh.edu.pl Ingo.Schiermeyer@tu-freiberg.de mwozniak@agh.edu.pl Abstract A graph G of order n is called arbitrarily partitionable (AP for short if, for every sequence (n 1,...,n k of positive integers with n 1 + +n k = n, there exists a partition (V 1,...,V k of the vertex set V(G such that V i induces a connected subgraph of order n i for i = 1,...,k. In this paper we show that every connected graph G of order n and with G > ( +1 edges is AP or belongs to few classes of exceptional graphs. Keywords: arbitrarily partitionable graph, Erdős-Gallai condition, traceable graph, perfect matching. 010 Mathematics Subject Classification: 05C38, 05C Introduction and Main Result We use standard notation of graph theory (cf. [8]. In particular, G and G will stand for the order and the size of a graph G, respectively. The minimum degree of a vertex in a graph G will be denoted by δ(g. By c(g we denote the circumference of a graph G, i.e., the length of a longest cycle. If G and H are two graphs with disjoint vertex sets, then the join of G and H is the graph, denoted by G H, with the vertex set V(G H = V(G V(H and the edge set E(G H = E(G E(H {xy : x V(G,y V(H}. Download Date 8/7/18 9:6 AM
2 6 R. Kalinowski, M. Pilśniak, I. Schiermeyer and M. Woźniak A sequence (n 1,...,n k of positive integers is called admissible for a graph G = (V,E of order n if n n k = n. An admissible sequence is said to be realizable in G if there exists a partition of V into k parts (V 1,...,V k such that V i = n i and the subgraph G[V i ] induced by V i is connected, for every i = 1,...,k. Such a partition is called a realization of the sequence (n 1,...,n k in G. Note that in fact the ordering of (n 1,...,n k is irrelevant, i.e., if this sequence is realizable in G, then it is also realizable after any permutation of its elements. We say that G is arbitrarily partitionable (AP for short if every admissible sequence is realizable in G. A simple example of an arbitrarily partitionable graph is a path P n. Two obvious and well-known facts play a key role in this paper. Proposition 1. If G has a spanning subgraph which is AP, then G is AP itself. Proposition. Every traceable graph is AP. The following easy observation sometimes makes proofs shorter and allows us to assume throughout the paper that every admissible sequence has all elements greater than 1. Proposition 3 [15]. A graph G is AP if and only if every admissible sequence (n 1,...,n k with n i for i = 1,...,k is realizable in G. The notion of AP graphs was introduced by Barth, Baudon and Puech [1] (and independently by Horňák and Woźniak [13] to model a problem in the design of computer networks (see [1] for details. The concept of arbitrarily partitionable graphs, sometimes also called arbitrarily vertex decomposable or fully decomposable or just decomposable, has spawned numerous papers. Some of them investigate AP graphs within some classes of graphs (e.g., [1,, 9, 7, 13], KPWZ1. Horňák, Tuza and Woźniak [14] introduced the notion of on-line arbitrarily partionable graphs, and then a few other definitions strengthening the condition for AP graphs appeared (e.g., [5, 6, 3, 16]. Here we present only those previous results on AP graphs we make use of in the paper. A sequence (d,...,d of length λ will be denoted by (d λ. A caterpillar with three leaves is denoted by Cat(a,b if it is obtained from the star K 1,3 by substituting two of its edges by paths of orders a and b, respectively (see Figure 1. As b = n a, we will later also use a shorter notation Cat(a. The following result was proved by Barth et al. [1], and independently by Horňák and Woźniak [13]. Theorem 4. The caterpillar Cat(a,b, with a b, is AP if and only if a and b are relatively prime. Moreover, each admissible and nonrealizable sequence is of the form (d k, where a b 0 (mod d and d > 1. Download Date 8/7/18 9:6 AM
3 Dense Arbitrarily Partitionable Graphs 7 a b Figure 1. Cat(a,b with a = 5,b = y 1 x a... x 1... y b Figure. Sun(a, b. Asun with r raysisagraphofordern r withr pendantverticesu 1,...,u r whose deletion yields a cycle C n r, and each vertex v i on C n r adjacent to u i is of degree three. If the sequence of vertices v i is situated on the cycle C n r in such a way that there are exactly a i 0 vertices, each of degree two, between v i and v i+1,i = 1,...,r (the indices taken modulo r, then this sun is denoted by Sun(a 1,...,a r. Suns with two and three rays are presented in Figures and 3, respectively. Kalinowski, Pilśniak, Woźniak and Zio lo characterized all AP suns with at most three rays.... x a y 1... x 1 z c... z 1 y b Figure 3. Sun(a,b,c. Theorem 5 [15]. A sun with two rays Sun(a,b is AP if and only if at most one of the numbers a and b is odd. Moreover, Sun(a,b of order n is not AP if and only if ( n/ is the unique admissible and nonrealizable sequence. Download Date 8/7/18 9:6 AM
4 8 R. Kalinowski, M. Pilśniak, I. Schiermeyer and M. Woźniak Theorem 6 [15]. A sun with three rays Sun(a,b,c is AP if and only if none of the following three conditions is fulfilled: (1 at most one of the numbers a,b,c is even, ( a b c 0 (mod3, (3 a b c (mod3. Moreover, if Sun(a,b,c is not AP, then at least one of the following three sequences ( n/, (3 n/3, (3,( (n 3/ is admissible and nonrealizable. In this paper we consider the following question. How many edges in a connected graph G guarantee that a graph is AP or belongs to few families of exceptional graphs? Dense AP graphs were already investigated in another context. This was initiated by Marczyk who proved in [18], [19] some Ore-type sufficient conditions for a graph to be AP. The best result in this direction is due to Horňák, Marczyk, Schiermeyer and Woźniak. Theorem 7 [1]. Every connected graph G of order n 0 such that the degree sum of each pair of nonadjacent vertices is at least n 5 is AP if and only if G admits a perfect matching or a quasi-perfect matching (i.e., a matching omitting exactly one vertex. K n K n 3 K n 3 K n 3 n n 3 n Figure 4. Four graphs such that every non-ap graph G with G > ( + 1 is a spanning subgraph of one of them (below each graph, requirements on the order n are given. Let us formulate now our main result. Theorem 8. If G is a connected graph of order n and size ( G > +1, Download Date 8/7/18 9:6 AM
5 Dense Arbitrarily Partitionable Graphs 9 then G is AP unless G is a spanning subgraph of one of the graphs depicted in Figure 4. It is easily seen that none of four graphs in Figure 4 is AP whenever its order n meets the divisibility condition given below the graph. By Proposition 1, every spanning subgraph is non-ap, as well. Observe also that the first two graphs have circumference c(g = n and the other two have c(g = n 3. It has to be noted that for n <, there are more graphs of order n and size greater than ( +1 that are not AP. For example, the graph G = K(n / K (n+/ has no perfect matching, and its size G = 1 [n n+ (n 1+ n ] is greater than ( + 1 for every even n = 10,...,0. Another example is the graph G = K (n 3/ K (n+3/ which has no realization of the sequence (3,( n 3, and its size G = 1 [n 3 n+3 (n 1+ n 3 ] is greater than ( +1 for every odd n = 11,...,17.. Preliminary Results This section contains an initial stage of the proof of Theorem 8. We will make use of some classical sufficient conditions for the existence of long cycles in a graph. Theorem 9 (Erdős, Gallai [11]. Let G be a graph of order n. If G > c (n 1, then c(g > c. Theorem 9 has been extended by Woodall. Theorem 10 (Woodall [0]. Let G be a graph of order n = t(c 1+p, where c, t 0 and 1 p c. If ( ( c p G > t +, then c(g > c. Taking t = 1,c = n δ and p = δ +1, we obtain the following Corollary 11. If n = G,δ = δ(g and ( n δ G > + then c(g > n δ. ( δ +1 The next theorem is the well-known Erdős sufficient condition for hamiltonicity depending on the size and minimum degree., Download Date 8/7/18 9:6 AM
6 10 R. Kalinowski, M. Pilśniak, I. Schiermeyer and M. Woźniak Theorem 1 (Erdős [10]. Let G be a graph of order n and with minimum degree δ. Denote { (n δ ( n f(n,δ = max +δ n 1, } n 1 +. If δ n or G > f(n,δ, then G is Hamiltonian. We can use Theorem 1 for traceability as follows. Let H = G K 1. Then H is Hamiltonian if and only if G is traceable. Denote g(n,δ = f(n+1,δ+1 n. Thus As ( n δ {( n δ g(n,δ = max +(δ +1 n, ( n+1 n } n + n. +(δ +1 n = ( n δ 1 +δ(δ +1, this justifies the following result. Corollary 13. Let G be a graph of order n and with minimum degree δ. If δ n 1 or {( n δ 1 G > max +δ(δ +1, ( n+1 n } n + n, then G is traceable, and hence AP. Suppose G is a graph with minimum degree δ and with G > ( +1. It follows from Corollary 13 that G is traceable whenever δ n 1 or g(n,δ g(n,3. Observe that ( n δ 1 +δ(δ +1 is a quadratic polynomial with respect to δ, so the latter inequality holds unless g(n,δ = ( n+1 n + n n and ( ( n+1 n +1 < n + n. We solve this inequality regarding to the parity of the order n of G. If n is even, then the inequality is equivalent to n 30n+176 < 0, so it holds only if 9 n 1. If n is odd, then we have n 4n+175 < 0, and this does not hold for any n. Obviously, every connected graph G with c(g = n 1 is traceable, and hence AP. Thus, Corollary 11 and Corollary 13 for δ = 3 imply that for the proof of our main result we are left with the following situation ( n, G > +1, 1 δ(g, and n 3 c(g n. Download Date 8/7/18 9:6 AM
7 Dense Arbitrarily Partitionable Graphs 11 The rest of our proof is divided into two parts corresponding to c(g = n (Section 3 and c(g = n 3 (Section 4. Let us state yet a lemma that follows the approach in [17] and will be used in both sections. First, we introduce some notation. If C is a cycle in a graph G = (V,E, then each vertex of C adjacent to a vertex outside C is called an attachment vertex. Fix an orientation of C. For two vertices x,y V(C we denote by C[x,y] the path of C from x to y along this orientation, and by C[x,y] the path from x to y along the reverse orientation of C. For a vertex x V(C we denote by x +,x its successor and its predecessor along the orientation of C. We also denote d C (x = N(x V(C. For two sets A,B V, let E(A,B = {xy E : x A,y B}. Lemma 14. Let G = (V,E be a connected graph of order n with δ(g and G > ( +1. Let C be a longest cycle in G such that the set V \V(C is not a clique. (1 If c(g=n 3, then each vertex outside C is of degree one. ( If c(g=n, then each vertex outside C has at most three neighbors on C. Proof. Let k = k(g = max{d C (u : u V \ V(C}, and let u be a vertex outside C with d C (u = k and N(u V(C = {u 1,...,u k }. Fix an orientation of C. Clearly, k c(g and the set X = {u + 1,...,u+ k } is independent since C is a longest cycle in G. Moreover, for any pair u + i,u+ j with i j and any z C[u ++ i,u j ] we have u + i z+ / E or zu + j / E, otherwise C would not be a longest cycle. Let C 1 = C[u ++ i,u j ],C = C[u ++ j,u i ]. Then a classical counting argument (cf. [8] shows that d C (u + i +d C(u + j = d C 1 (u + i +d C 1 (u + j +d C (u + i +d C (u + j V(C V(C +1 = V(C. Summing up this inequality for all ( k possible pairs of vertices and dividing by k 1 we obtain k i=1 d C(u + i k c(g. Now we want to estimate Ē(C, i.e., the number of edges within C that are missing in G. Since X is independent, all edges incident to vertices from X are contained in E(X,V(C\X. Hence Ē(C Ē(X,V(C\X + Ē(G[X] k(c(g k k c(g+( k = k (c(g k 1. As V \V(C is not a clique and each vertex of V \V(C is connected to C by at most k edges, the number f(k = Ḡ of edges missing in the graph G satisfies the inequality f(k 1+(n c(g(c(g k+ k (c(g k 1. Download Date 8/7/18 9:6 AM
8 1 R. Kalinowski, M. Pilśniak, I. Schiermeyer and M. Woźniak However, itisnotdifficulttoseethatifk = k(gandf(k = 1+(n c(g(c(g k+ k (c(g k 1 for a graph G, then δ(g = d(u = k +n c(g where u is a vertex outside C. Note that k+n c(g k+1 if c(g n 3. But δ(g by assumption, hence we have to increase f(k by k 1, so actually f(k (n c(g(c(g k+ k (c(g k +1. Note that ( ( n ( 1 = 4n, hence f(k 4n 3since G > +1. Consider first the case c(g = n 3. Then f(k 3(n k 3+ k (n k. Suppose, contrary to the claim, that k. We search for the smallest value of f(k. The derivative f (k = n k 4 is nonnegative for k n 4. Hence f(k is increasing for k n 4, and decreasing for n n 3 4 k. We have f( = 4n 19 > 4n 3. Also, f( n 3 = n +8n 33 8, and f( n 3 (4n 3 = 1 8 (n 4n > 0 for any n 14. Thus f(k > 4n 3 for every k with k n 3, a contradiction. Now, let c(g = n. Thus f(k = (n k + k (n k 1 and f (k = n 5 k. Hence f(k is increasing for k n 5, and decreasing for n 5 k n. Note that f(4 = 4 n > 4n 3, and f(n = 1 8 (n +6n 16 > 4n 3 because 1 8 (n + 6n 16 (4n 3 = 1 8 (n 6n > 0. Therefore k 3. In most cases considered in the next two sections, we apply the following strategy. To prove that a graph G = (V,E satisfying certain conditions has no more than ( + 1 edges, we choose a graph G0 such that V(G 0 = V, G 0 ( + 1, and there exists an injective mapping of E \ E(G0 into E(G 0 \E, whence G G Proof for Circumference n To prove that Theorem 8 holds for graphs with circumference n, it is enough to justify the following. Proposition 15. If G = (V,E is a connected graph of order n with c(g = n and G > ( +1, then G is AP unless n is even and G is a spanning subgraph of one of two graphs of even order shown in Figure 5. Proof. Let C be a longest cycle in G and let u,v be the two vertices outside C. Clearly, G is traceable if uv E. Then assume uv / E. First suppose that there is only one attachment vertex. If n is even, then the sequence ( n/ is not realizable, G is not AP and is a spanning subgraph of the first graph in Figure 5 when G > ( +1 what is possible for n 10. Download Date 8/7/18 9:6 AM
9 Dense Arbitrarily Partitionable Graphs 13 K n K n 3 n n Figure 5. Exceptional supergraphs with circumference n. If n is odd, then an admissible sequence contains an element n i 3. We take a part V i containing u,v and their common neighbour, and the remaining graph is traceable, so G is AP. Now assume that there are at least two attachment vertices. For every pair of independent edges uu,vv with u,v V(C, the deletion of u,v from C yields two paths of orders a and b such that a+b = and 0 a b. Thus Sun(a,b is a spanning subgraph of G. By Theorem 5, the graph G is AP when at most one of the numbers a,b is odd (in particular when n is odd. Henceforth, we assume that n is even and both a and b are odd for any pair of independent edges uu,vv. Again, Theorem 5 implies that to prove that G is AP, it suffices to show that the sequence ( n/ is realizable in G, i.e., G admits a perfect matching. Choose edges uu,vv such that a is as large as possible (and not greater than b, and denote the vertices of C by u,x 1,...,x a,v,y 1,...,y b according to the orientation of C. Suppose that G is not AP. Case a = 1. Suppose first that there are only two attachment vertices. Then d(u and d(v. Let d(x 1 =. If n is even, then G has no perfect matching and is a spanning subgraph of the second graph in Figure 5 whenever G > ( +1, and the latter inequality may hold for n 1. Then assume that d(x 1 3, i.e., C has at least one chord incident to x 1. We will show that in this case there does not exist a non-ap graph satisfying our assumptions. Indeed, suppose there exists such a graph G. First observe that x 1 cannot be adjacent to any vertex y l 1 since otherwise G would have a perfect matching: {uu,vv,x 1 y l 1 } {x i 1 x i : i = 1,...,l 1} {x i x i+1 : i = l,..., b 1 }. Suppose l is the smallest positive integer such that x 1y l E. Without loss of generality, we may assume that l < b (we can change the orientation of C, if necessary, i.e., l 4. For any i l and j l, an edge Download Date 8/7/18 9:6 AM
10 14 R. Kalinowski, M. Pilśniak, I. Schiermeyer and M. Woźniak y i 1 y j+1 would give a perfect matching if it appeared in G. The number of these edges equals l( l l, and they are missing in G. Moreover, for every p > l, an edge x 1 y p E creates a new missing edge y p 1 y p+1, and an edge y 1 y p E, except for p = n 6, creates another missing edge y p 1y p+3. Hence G ( +8+l l( l+1 ( +9+l l ( +9, a contradiction. v u x 1 y b Figure 6. Three attachment vertices for a = 1. It is easily seen that the number of attachment vertices can be at most three as a = 1 was chosen greatest possible. Then one of the vertices outside C, say u, is a pendant vertex and v is adjacent to y b 1 (see Figure 6. Suppose that G satisfies our assumptions and has no perfect matching. Then clearly, x 1 y b, as well ( as x 1 y i+1 and y b y i+1 cannot belong to E. Consider a graph G 0 of size +10 such that V(G0 = V, the set V \{u,v,x 1,y b } is a clique, and E(G 0 containsalsotheedgesuu,vv,vu,vy b 1,v x 1,x 1 u,u y b,y b y b 1,x 1 y b 1,y b v. For every l = 1,..., b 3, whenever x 1y l belonged to E, the edge y l 1 y l+1 would create a perfect matching in G, thus it is missing in G, and whenever y b y l E (except l = b 3, then y l 1 y l+3 is missing in G. Therefore G G 0 +1 = ( +11 < ( +1, a contradiction. Case a 3. It follows from Lemma 14 that the vertices u,v are of degree at most three, since the total number of vertices incident to them cannot be greater than six. Let G 1 be a graph of size ( + 1 containing these six edges, six edges x 1 x,x 1 u,x 1 v,x a x,x a u,x a v and ( edges of the clique V \ {u,v,x 1,x a }. If a = 3, we set G 0 = G 1. For a 5, we define G 0 as follows. We add to G 1 the edges x 1 x j,x a x j, j =,..., a 1, and delete the edges x i 1 y j 1, i =,..., a 1 b+1,j = 1,...,. Thus the number of added edges equals a 3, and the number of deleted ones equals a 1 b+1 and is not smaller than a 1 4 since b a. Therefore G 0 < G 1. Observe that the set {x i : i = Download Date 8/7/18 9:6 AM
11 Dense Arbitrarily Partitionable Graphs 15 1,..., a 1 } {y i : i = 1,...,b} {u,v } forms a clique in G 0, and the only edges that may appear in G and not in G 0 are of the form x ν x j 1 or x ν y l, where ν {1,a}. For any i = 1,..., a 1, if x 1x i+1 E, then y 1 x i / E, and if x a x i 1 E, then y b x i / E, otherwise G has a perfect matching. For any j = 1,..., b 1, if x 1 y j E, then y 1 y j+1 / E, and if x a y j E, then y b y j 1 / E. It is easy to see that we have just defined an injective mapping of E \E(G 0 into E(G 0 \E unless the edge y 1 y b was counted twice as a missing edge in E. This means that either G G 0 ( +1 or G = G0 +1 = ( +13. But it is easy to see that in the latter case δ(g = 3, so G is traceable by Corollary 13. We thus obtained a contradiction in both cases. 4. Proof for Circumference n 3 In this section we accomplish the proof of our main result by showing that Theorem 8 holds for graphs with circumference n 3. Let us introduce some additional notation first. For any two vertices x and y of a cycle C of a sun S with a fixed orientation, we denote by xcy the caterpillar consisting of a path C[x,y] together with the leaves of S if the corresponding attachment vertex belongs to C[x,y]. By y Cx we denote the same caterpillar but in the reverse order. Let G = (V,E be a connected graph of size G > ( + 1, and let C be a longest cycle of G of length n 3. Lemma 14 states that each of three vertices u,v,w outside C has at most one neighbor on C. The attachment vertices of C adjacent to u,v,w are denoted by u,v,w, respectively (some of the vertices u,v,w may coincide or do not exist if there are less than three attachment vertices. If C has three attachment vertices, denote the vertices of C by u,x 1,...,x a,v,y 1,...,y b,w,z 1,...,z c according to a fixed orientation of C. Let X = {x i : i = 1,...,a}, Y = {y i : i = 1,...,b}, Z = {z i : i = 1,...,c}. If C has only two attachment vertices, then we assume that Z is empty, and C is the sequence u,x 1,...,x a,v,y 1,...,y b. If a 1 and b, then two edges of the form x 1 y i+1,x a y i are said to be a good couple from X to Y. The case a = 1 is allowed. Analogously we define good couples from Y to X, from X to Z and so on (see Figure 7. Lemma 16. Let C be a longest cycle of a connected graph G = (V,E of size G > ( +1 and circumference c(g = n 3. If the number of attachment vertices of C is two and their distance on C is at least three, then there exists a good couple of edges in G. Proof. Using the notation from the beginning of this section, we may assume without loss of generality that w is a vertex adjacent to v or v. Then G w is Download Date 8/7/18 9:6 AM
12 16 R. Kalinowski, M. Pilśniak, I. Schiermeyer and M. Woźniak x 1 x a v w z i+1 z i Figure 7. A good couple of edges from X to Z. spanned by Sun(a,b where a b and a+b = n 5. There are three or four edges outside C, therefore the number of chords of C missing in the graph G is less than n+1. Indeed, ( ( n = n 1. Suppose that there is no good couple of edges in G. Then for every i = 1,...,b 1, if x 1 y i+1 E, then x a y i / E. It follows that the number of missing edges between {x 1,x a } and Y is at least b 1. Moreover, for every i =,...,a 1, if y 1 x i+1 E, then y b x i / E. Therefore the total number of missing chords between X and Y is at least a 3+b 1 = n 9 > n 1, a contradiction. Lemma 17. Let C be a longest cycle of a connected graph G = (V,E of size G > ( + 1 and circumference c(g = n 3. If C has three attachment vertices and no two of them are consecutive vertices on C, then there exists a good couple of edges in G. Proof. By assumptions, the graph G is spanned by Sun(a,b,c where 1 a b c and a+b+c = n 6. Lemma 14 implies that there are exactly three edges outside C. Hence, there are less than n 1 chords of C missing in G. Assume that G has no good couple of edges. Suppose first that a = b = 1. Then x 1 z i+1 E implies x 1 z i / E, i = 1,...,c 1, otherwise these two edges would be a good couple. Therefore, there are at least c 1 missing edges from x 1 to Z. Analogously, the number of missing edges between y 1 and Z is not less than c 1. Altogether, we get at least c 1 = n 9 > n 1 missing chords of C, a contradiction. Suppose now that a = 1 and b. We analogously infer that there are at least c 1 missing edges from x 1 to Z. For any i = 1,...,c 1, whenever y 1 z i+1 is an edge in G, then y b z i is not, for, otherwise these two edges would be a good couple. Thus there are at least c 1 chords of C between {y 1,y b } and Z missing in G. Furthermore, z 1 y i+1 E implies z c y i / E for i =,...,b 1, so we get additional b 3 missing edges between Y and Z. Hence there are at least Download Date 8/7/18 9:6 AM
13 Dense Arbitrarily Partitionable Graphs 17 c 1 +c 1+b 3 3 c+b 5 = n 1+ c > n 1, again a contradiction. Finally, let a. Denote by ρ the number of edges joining x a with the set Z. Then c ρ edges between x a and Z are missing. Moreover, for each edge x a z i, the edge x 1 z i+1 is missing. Therefore, at least ρ edges between x 1 and Z are missing. So, since there is no good couple from X to Z, at least (c ρ+ρ = c edges joining the vertices x 1 and x a with Z are missing. Analogously, since there is no good couple from X to Y as well as Y to Z we can show that there are at least b missing edges joining the vertices x 1 and x a with Y and at least c missing edges joining the vertices y 1 and y b with Z. Therefore, there are at least c+(b+c missing edges, and since b + c 3 (n 6 and c 1 3 (n 6, we have at least n 6 > n 1 missing edges, a contradiction. Let C have only one attachment vertex u. If the subgraph G[{u,v,w}] induced by u,v,w is traceable, then G is traceable itself. If all three vertices u,v,w are pendant in G, then G is a spanning subgraph of the third graph in Figure 4 and is not AP for any n because either ( n/ or (3,( (n 3/ is an admissible and nonrealizable sequence. Otherwise, G[{u, v, w}] has exactly one edge, say uv, and G is a spanning subgraph of the fourth graph in Figure 4. Then G is not AP if and only if the order n of G is a multiple of three since the sequence (3 n/3 cannot be realized. For any other n, every admissible sequence (n 1,...,n k either has an element n i = or n i 4. If n i = we take a corresponding part V i = {u,v} and if n i 4 we take V i {u,v,w,u }. Then G V i is traceable, and hence AP. Suppose that C has two attachment vertices u,v with uu,vv E. As before, we assume that w is adjacent v or v. Observe that the subgraph G = G w of size G ( + 11 is spanned by a sun with two rays Sun(a,b with 0 a b. We will first show that G is traceable. This is clear for a = 0. If a then G has a good couple of edges. Without loss of generality, we may assume that x 1 y i+1,x a y i is a good couple. Then vv y 1 y i x a x 1 y i+1 y b u u is a Hamiltonian path of G. If a = 1, suppose that G is not traceable and consider the graph G 0 such that V(G 0 = V(G and E(G 0 consists of ( +4 edges: uu,vv,u x 1,v x 1 and all edges of the clique induced by V(C\{x 1 }. Hence G hasatleastsevenchordsincidenttox 1. However, ife(g containedx 1 y 1 orx 1 y b, then it is easy to see that G would be traceable. Moreover, for i =,...,b 1, if x 1 y i E(G then y i 1 y b / E(G since otherwise vv y 1 y i 1 y b y i x 1 u u would be a Hamiltonian path of G. Thus G G 0 < ( +11, a contradiction. It follows that G is traceable whenever vw E. Then assume vw / E. Let (n 1,...,n k be an admissible sequence for G ordered decreasingly: n 1 n k. If n 1 3, then we put w,v,v to V 1 and continue a partition of V along the Hamiltonian path of G. Otherwise, (n 1,...,n k = ( n/ and n is even. Download Date 8/7/18 9:6 AM
14 18 R. Kalinowski, M. Pilśniak, I. Schiermeyer and M. Woźniak Then G is a spanning subgraph of the second graph in Figure 4 without a perfect matching. To end the proof of Theorem 8 it suffices to settle the case when a longest cycle C has three attachment vertices. Lemma 18. Let G = (V,E be a graph of size G > ( +1 and circumference c(g = n 3. If a longest cycle C has three attachment vertices, then G is AP. Proof. It follows from Lemma 14, that there are exactly three independent edges outside C, namely uu,vv,ww, and G is spanned by Sun(a,b,c where 0 a b c n 6. To show that G is AP, we consider three cases depending on admissible sequences. Case 1: Sequence ( n/. Suppose that the sequence ( n/ is admissible but not realizable in the graph G. Hence exactly two of the numbers a,b,c are odd, say a and b with a b. Let a = 1. Consider a graph G 0 of size G 0 = ( + 6 containing all edges of the clique V \ {u,v,w,x 1 } and the edges uu,vv,ww,u x 1,x 1 v,x 1 w. It follows that x 1 is adjacent to at least seven vertices of Y Z. However, any edge of the form x 1 y l 1 would give a perfect matching in G. Moreover, if x 1 y l E, then y 1 y l+1 / E. Furthermore, if x 1 z l E, then y 1 z l 1 / E, and if x 1 z l 1 E, then y 1 z l / E, otherwise G would have a perfect matching. Therefore G G 0, a contradiction. Let a 3. Here we argue similarly as in Section 3 for a 3. Let G 1 be a graph of size ( n containing the edges uu,vv,ww,u x 1, x 1 x,x 1 v,x 1 w, x a x,x a u,x a v,x a w and all edges of the clique formed by V \ {u,v,w,x 1,x a }. If a = 3, we set G 0 = G 1. For a 5, we define G 0 as follows. We add to G 1 the edges x 1 x j,x a x j, j =,..., a 1, and delete the edges x i 1y j 1, i =,..., a 1 b+1,j = 1,...,. Thus the number of added edges equals a 3, and the number of deleted ones equals a 1 b+1 and is not smaller than a 1 4 since b a. Therefore G 0 < G 1. To avoid a perfect matching, the only edges that may appear in G and are not in G 0 are of the form x ν x i 1 or x ν y j or x ν z l where ν {1,a}. For any i = 1,..., a 1, if x 1x i+1 E, then y 1 x i / E, and if x a x i 1 E, then y b x i / E, otherwise G admits a perfect matching. For any j = 1,..., b 1, if x 1 y j E, then y 1 y j+1 / E, and if x a y j E, then y b y j 1 / E (here the edge y 1 y b may be counted twice as missing in E. For any j = 1,..., c 1, if x 1 z j E, then y 1 z j 1 / E, and if x a z j E, then y b z j 1 / E. Finally, for any j = 1,..., c+1, if x 1z j 1 E, then y 1 z j / E, and if x a z j 1 E, then y b z j / E. Whence, G G 0 +1 ( +1, a contradiction. Case : Sequence (3 n/3. Suppose that the sequence (3 n/3 is admissible but Download Date 8/7/18 9:6 AM
15 Dense Arbitrarily Partitionable Graphs 19 is not realizable in G. It easily follows from Theorem 6 that either a b c 0 (mod3 or a b c (mod3. Assume first that a b c 0 (mod3. Let 0 a b c. Put V 1 = {u,u,z c } and V = {w,w,z 1 }. Let G 0 be a subgraph of G obtained by deletingallchordsofc incidenttov exceptv z 1 andv z c. Then G 0 ( +7, and there are another chords of C incident to v in G. Suppose a = b = 0. If v z 3l+ was an edge of G for some l 0, then the sequence (3 n/3 would have a realization in G. Indeed, we put V 3 = {v,v,z 3k+ } and observe that the cycle C splits into at most four paths of order divisible by 3 after removing the vertices of V 1 V V 3. Also, if v z 3l E with 1 l c 3 1, then z 3l 1z 3l+1 / E otherwise G has a realization of (3 n/3. Similarly, if v z 3l+1 E with 1 l c 3 1, then z 3lz 3l+ / E. Suppose b > 0. If v y 3k E, then y 3k 1 z / E, since otherwise we would have a realization of (3 n/3 by taking V 3 = {y 3k,y 3k 1,z }. Analogously, if v y 3k+1 E, then y 3k+ z / E because we could take V 3 = {y 3k+,y 3k,z }. Again, if both edges v y 3k+ and y 3k+1 z 1 appeared in G, then we could redefine V = {w,w,y b } and put V 3 = {v,v,y 3k+ }, V 4 = {y 3k+1,z 1,z } to obtain a realization of (3 n/3. If also a > 0, then the same arguments as in the previous paragraph for b > 0 can be applied to justify the assertion: every new chord from E \E(G 0 causes the absence of another chord in G. It follows that G G 0 < ( +1. Now, assume that a b c (mod3. Let V 1 = {u,u,x 1 },V = {v,v,x a },V 3 = {w,w,y b }. Remember that the number of chords of C missing in G is at most n 1. For every i = 1,..., b 3 and j = 1,..., c 3, the vertex y 3i cannot be a neighbor neither of z 3j nor of z 3j 1 because then we could take V 4 = {y 3i,z 3j,z 3j 1 }, and C would split into paths of orders being multiples of three after removing V 1 V V 3 V 4. Analogously, y 3i 1 z 3j,y 3i 1 z 3j 1 / E. Thus, there are 4 b 3 c 3 missing chords of C. As b + c 3 (n 6, we have 4 9 bc 4 81 (n 6 > n 1 for any n, a contradiction. Case 3: Sequences different from ( n/ and (3 n/3. Consider first the case a 1. Then, we can apply Lemma 17. Without loss of generality, we may assume that the good couple is from X to Z, i.e., there is an i such that x 1 z i+1,x a z i E and 1 i c. Then, observe that the subgraph of G induced by the vertex sequence x 0 Czi+1 x 1 Cx a z i Cv contains a caterpillar Cat(b+3. So, by Theorem 4, we are able to realize all admissible sequences except, maybe, for sequences of the form (d n/d for d (b+3. If a = 1, then a part of such a sequence could be realized on the caterpillar Cat( = x 1 Cy b of order b+3 because d by assumption, and the rest of it on the path ww Cu u. If a, then a part of this sequence could be realized either on Cat( = x 1 Cy b or on Cat( = y 1 Cz 1, and the rest of the sequence either on Cat(a = x a 1 Cw or on Cat(a+3 = v Cz, respectively. If none of the two latter caterpillars admits a realization of the sequence (d n/d Download Date 8/7/18 9:6 AM
16 0 R. Kalinowski, M. Pilśniak, I. Schiermeyer and M. Woźniak that means that d a and d (a+3. This implies that d = 3. Let a = 0 and b 1. Then G contains a caterpillar Cat(b+3 = vv Cu u. So, by Theorem 4, any admissible and nonrealizable sequence should be of the form (d n/d for d (b + 3. As d, then a part of such a sequence could be realized on Cat( = y 1 Cz 1, and the rest of the sequence on Cat(3 = vv Cz, except for the case where d = 3. If a = b = 0 then it is easy to see that G is spanned by a caterpillar Cat(3, so only the sequence (3 n/3 may not be realizable. K n n 1 Figure 8. A non-ap graph of size ( Final Remarks The following is an easily seen consequence of Corollary 13. Proposition 19. If G is a connected graph of order n and size G > ( n +, then G is traceable. Clearly, the bound ( n + is sharp for every n 4 since the first graph shown in Figure 4 (a clique K n with two pendant edges attached to it in one vertex is not traceable. The difference between ( n + and the lower bound ( +1 in our main result equals n 17. Observe that there are quite many connected nontraceable graphs G with more than ( + 1 edges, which are AP by Theorem 8. In particular, if the order n of G is not divisible neither by two nor by three, then G is AP unless it is a spanning subgraph of the third graph in Figure 4 (a clique K n 3 with three pendant edges attached in one and the same vertex. Moreover, for every n if Download Date 8/7/18 9:6 AM
17 Dense Arbitrarily Partitionable Graphs 1 c(g = n 3 and G has three independent pendant edges, then G is AP, and clearly nontraceable. It has to be noted that if we decrease the bound ( + 1 even by one, then we obtain new exceptional graphs that are not AP. For example, the graph in Figure 8 has ( +1 edges and is not AP for even n. References [1] D. Barth, O. Baudon and J. Puech, Network sharing: a polynomial algorithm for tripodes, Discrete Appl. Math. 119 ( doi: /s x(00003-x [] O. Baudon, J. Bensmail, R. Kalinowski, A. Marczyk, J. Przyby lo and M. Woźniak, On the Cartesian product of an arbitrarily partitionable graph and a traceable graph, Discrete Math. Theor. Comput. Sci. 16 ( [3] O. Baudon, J. Bensmail, J. Przyby lo and M. Woźniak, Partitioning powers of traceable or Hamiltonian graphs, Theoret. Comput. Sci. 50 ( doi: /j.tcs [4] O. Baudon, F. Foucaud, J. Przyby lo and M. Woźniak, On the structure of arbitrarily partitionable graphs with given connectivity, Discrete Appl. Math. 16 ( doi: /j.dam [5] O. Baudon, F. Gilbert and M. Woźniak, Recursively arbitrarily vertex decomposable graphs, Opuscula Math. 3 ( doi: /opmath [6] O. Baudon, F. Gilbert and M. Woźniak, Recursively arbitrarily vertex decomposable suns, Opuscula Math. 31 ( doi: /opmath [7] O. Baudon, J. Przyby lo and M. Woźniak, On minimal arbitrarily partitionable graphs, Inform. Process. Lett. 11 ( doi: /j.ipl [8] J.A. Bondy and U.S.R. Murty, Graph Theory (Springer, 008. [9] H.J. Broersma, D. Kratsch and G.J. Woeginger, Fully decomposable split graphs, Lecture Notes in Comput. Sci ( doi: / [10] P.Erdős, Remarks on a paper of Pósa, Magyar Tud. Akad. Mat. Kutató Int. Kőzl. 7 ( [11] P.Erdős and T.Gallai, On maximal paths and circuits of graphs, Acta Math. Acad. Sci. Hungar. 10 ( doi: /bf [1] M.Horňák, A.Marczyk, I.Schiermeyer and M.Woźniak, Dense arbitrarily vertex decomposable graphs, Graphs Combin. 8 ( doi: /s Download Date 8/7/18 9:6 AM
18 R. Kalinowski, M. Pilśniak, I. Schiermeyer and M. Woźniak [13] M. Horňák and M. Woźniak, Arbitrarily vertex decomposable trees are of maximum degree at most six, Opuscula Math. 3 ( [14] M. Horňák, Zs. Tuza and M. Woźniak, On-line arbitrarily vertex decomposable trees, Discrete Appl. Math. 155 ( doi: /j.dam [15] R. Kalinowski, M. Pilśniak, M. Woźniak and I.A. Zio lo, Arbitrarily vertex decomposable suns with few rays, Discrete Math. 309 ( doi: /j.disc [16] R. Kalinowski, M. Pilśniak, M. Woźniak and I.A. Zio lo, On-line arbitrarily vertex decomposable suns, Discrete Math. 309 ( doi: /j.disc [17] A. Kemnitz and I. Schiermeyer, Improved degree conditions for Hamiltonian properties, Discrete Math. 31 ( doi: /j.disc [18] A. Marczyk, A note on arbitrarily vertex decomposable graphs, Opuscula Math. 6 ( [19] A. Marczyk, An Ore-type condition for arbitrarily vertex decomposable graphs, Discrete Math. 309 ( doi: /j.disc [0] D.R.Woodall, Maximal circuits of graphs I, Acta Math. Acad. Sci. Hungar. 8 ( doi: /bf Received 19 January 015 Revised 18 March 015 Accepted 18 March 015 Download Date 8/7/18 9:6 AM
Antoni 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 informationOn the longest path in a recursively partitionable graph
On the longest path in a recursively partitionable graph Julien Bensmail To cite this version: Julien Bensmail. On the longest path in a recursively partitionable graph. 2012. HAL Id:
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 informationTechnische Universität Ilmenau Institut für Mathematik
Technische Universität Ilmenau Institut für Mathematik Preprint No. M 07/06 Cyclic sums, network sharing and restricted edge cuts in graphs with long cycles Rautenbach, Dieter; Volkmann, Lutz 2007 Impressum:
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 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 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 informationSATURATION SPECTRUM OF PATHS AND STARS
1 Discussiones Mathematicae Graph Theory xx (xxxx 1 9 3 SATURATION SPECTRUM OF PATHS AND STARS 4 5 6 7 8 9 10 11 1 13 14 15 16 17 18 Jill Faudree Department of Mathematics and Statistics University of
More informationOn decomposing graphs of large minimum degree into locally irregular subgraphs
On decomposing graphs of large minimum degree into locally irregular subgraphs Jakub Przyby lo AGH University of Science and Technology al. A. Mickiewicza 0 0-059 Krakow, Poland jakubprz@agh.edu.pl Submitted:
More informationON 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 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 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 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 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 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 informationInduced Saturation of Graphs
Induced Saturation of Graphs Maria Axenovich a and Mónika Csikós a a Institute of Algebra and Geometry, Karlsruhe Institute of Technology, Englerstraße 2, 76128 Karlsruhe, Germany Abstract A graph G is
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 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 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 informationPerfect matchings in highly cyclically connected regular graphs
Perfect matchings in highly cyclically connected regular graphs arxiv:1709.08891v1 [math.co] 6 Sep 017 Robert Lukot ka Comenius University, Bratislava lukotka@dcs.fmph.uniba.sk Edita Rollová 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 informationarxiv: v1 [math.co] 4 Jan 2018
A family of multigraphs with large palette index arxiv:80.0336v [math.co] 4 Jan 208 M.Avesani, A.Bonisoli, G.Mazzuoccolo July 22, 208 Abstract Given a proper edge-coloring of a loopless multigraph, the
More 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 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 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 informationStability in the Erdős Gallai Theorems on cycles and paths
Journal of Combinatorial Theory, Series B 11 (016) 197 8 Contents lists available at ScienceDirect Journal of Combinatorial Theory, Series B www.elsevier.com/locate/jctb Stability in the Erdős Gallai Theorems
More informationALL GRAPHS WITH PAIRED-DOMINATION NUMBER TWO LESS THAN THEIR ORDER. Włodzimierz Ulatowski
Opuscula Math. 33, no. 4 (2013), 763 783 http://dx.doi.org/10.7494/opmath.2013.33.4.763 Opuscula Mathematica ALL GRAPHS WITH PAIRED-DOMINATION NUMBER TWO LESS THAN THEIR ORDER Włodzimierz Ulatowski Communicated
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 informationEulerian Subgraphs in Graphs with Short Cycles
Eulerian Subgraphs in Graphs with Short Cycles Paul A. Catlin Hong-Jian Lai Abstract P. Paulraja recently showed that if every edge of a graph G lies in a cycle of length at most 5 and if G has no induced
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 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 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 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 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 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 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 informationGraphs with Integer Matching Polynomial Roots
Graphs with Integer Matching Polynomial Roots S. Akbari a, P. Csikvári b, A. Ghafari a, S. Khalashi Ghezelahmad c, M. Nahvi a a Department of Mathematical Sciences, Sharif University of Technology, Tehran,
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 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 informationOn colorability of graphs with forbidden minors along paths and circuits
On colorability of graphs with forbidden minors along paths and circuits Elad Horev horevel@cs.bgu.ac.il Department of Computer Science Ben-Gurion University of the Negev Beer-Sheva 84105, Israel Abstract.
More 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 information3-choosability of triangle-free planar graphs with constraint on 4-cycles
3-choosability of triangle-free planar graphs with constraint on 4-cycles Zdeněk Dvořák Bernard Lidický Riste Škrekovski Abstract A graph is k-choosable if it can be colored whenever every vertex has a
More 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 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 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 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 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 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 information3-CHOOSABILITY OF TRIANGLE-FREE PLANAR GRAPHS WITH CONSTRAINT ON 4-CYCLES
University of Ljubljana Institute of Mathematics, Physics and Mechanics Department of Mathematics Jadranska 19, 1000 Ljubljana, Slovenia Preprint series, Vol. 47 (2009), 1080 3-CHOOSABILITY OF TRIANGLE-FREE
More information3-choosability of triangle-free planar graphs with constraints on 4-cycles
3-choosability of triangle-free planar graphs with constraints on 4-cycles Zdeněk Dvořák Bernard Lidický Riste Škrekovski Abstract A graph is k-choosable if it can be colored whenever every vertex has
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 informationExtensions of a theorem of Erdős on nonhamiltonian graphs
Extensions of a theorem of Erdős on nonhamiltonian graphs Zoltán Füredi Alexandr Kostochka Ruth Luo March 9, 017 Abstract arxiv:1703.1068v [math.co] 5 Apr 017 Let n, d be integers with 1 d, and set hn,
More informationDISTINGUISHING CARTESIAN PRODUCTS OF COUNTABLE GRAPHS
Discussiones Mathematicae Graph Theory 37 (2017) 155 164 doi:10.7151/dmgt.1902 DISTINGUISHING CARTESIAN PRODUCTS OF COUNTABLE GRAPHS Ehsan Estaji Hakim Sabzevari University, Sabzevar, Iran e-mail: ehsan.estaji@hsu.ac.ir
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 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 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 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 informationUnmixed Graphs that are Domains
Unmixed Graphs that are Domains Bruno Benedetti Institut für Mathematik, MA 6-2 TU Berlin, Germany benedetti@math.tu-berlin.de Matteo Varbaro Dipartimento di Matematica Univ. degli Studi di Genova, Italy
More informationFactors in Graphs With Multiple Degree Constraints
Factors in Graphs With Multiple Degree Constraints Richard C. Brewster, Morten Hegner Nielsen, and Sean McGuinness Thompson Rivers University Kamloops, BC V2C0C8 Canada October 4, 2011 Abstract For a graph
More informationLocating-Total Dominating Sets in Twin-Free Graphs: a Conjecture
Locating-Total Dominating Sets in Twin-Free Graphs: a Conjecture Florent Foucaud Michael A. Henning Department of Pure and Applied Mathematics University of Johannesburg Auckland Park, 2006, South Africa
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 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 informationLaplacian Integral Graphs with Maximum Degree 3
Laplacian Integral Graphs with Maximum Degree Steve Kirkland Department of Mathematics and Statistics University of Regina Regina, Saskatchewan, Canada S4S 0A kirkland@math.uregina.ca Submitted: Nov 5,
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 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 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 informationOn Hamiltonian cycles and Hamiltonian paths
Information Processing Letters 94 (2005) 37 41 www.elsevier.com/locate/ipl On Hamiltonian cycles and Hamiltonian paths M. Sohel Rahman a,, M. Kaykobad a,b a Department of Computer Science and Engineering,
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 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 informationarxiv: v1 [cs.dm] 12 Jun 2016
A Simple Extension of Dirac s Theorem on Hamiltonicity Yasemin Büyükçolak a,, Didem Gözüpek b, Sibel Özkana, Mordechai Shalom c,d,1 a Department of Mathematics, Gebze Technical University, Kocaeli, Turkey
More informationPAIRS OF EDGES AS CHORDS AND AS CUT-EDGES
Discussiones Mathematicae Graph Theory 34 (2014) 673 681 doi:10.7151/dmgt.1755 PAIRS OF EDGES AS CHORDS AND AS CUT-EDGES Terry A. McKee Department of Mathematics and Statistics Wright State University
More informationarxiv: v2 [math.co] 19 Aug 2015
THE (2k 1)-CONNECTED MULTIGRAPHS WITH AT MOST k 1 DISJOINT CYCLES H.A. KIERSTEAD, A.V. KOSTOCHKA, AND E.C. YEAGER arxiv:1406.7453v2 [math.co] 19 Aug 2015 Abstract. In 1963, Corrádi and Hajnal proved that
More informationarxiv: v1 [math.co] 7 Aug 2017
Locally Searching for Large Induced Matchings Maximilian Fürst, Marilena Leichter, Dieter Rautenbach arxiv:1708.008v1 [math.co] 7 Aug 017 Institut für Optimierung und Operations Research, Universität Ulm,
More informationTHE COMPLEXITY OF DISSOCIATION SET PROBLEMS IN GRAPHS. 1. Introduction
THE COMPLEXITY OF DISSOCIATION SET PROBLEMS IN GRAPHS YURY ORLOVICH, ALEXANDRE DOLGUI, GERD FINKE, VALERY GORDON, FRANK WERNER Abstract. A subset of vertices in a graph is called a dissociation set if
More informationON THE CORE OF A GRAPHf
ON THE CORE OF A GRAPHf By FRANK HARARY and MICHAEL D. PLUMMER [Received 8 October 1965] 1. Introduction Let G be a graph. A set of points M is said to cover all the lines of G if every line of G has at
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 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 informationFixed Parameter Algorithms for Interval Vertex Deletion and Interval Completion Problems
Fixed Parameter Algorithms for Interval Vertex Deletion and Interval Completion Problems Arash Rafiey Department of Informatics, University of Bergen, Norway arash.rafiey@ii.uib.no Abstract We consider
More informationObstructions for three-coloring graphs without induced paths on six vertices
Obstructions for three-coloring graphs without induced paths on six vertices Maria Chudnovsky 1, Jan Goedgebeur 2, Oliver Schaudt 3, and Mingxian Zhong 4 1 Princeton University, Princeton, NJ 08544, USA.
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 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 informationDiscrete Mathematics
Discrete Mathematics 09 (2009) 49 502 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: www.elsevier.com/locate/disc 2-distance ( + 2)-coloring of planar graphs with girth
More 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 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 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 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 informationProperties of θ-super positive graphs
Properties of θ-super positive graphs Cheng Yeaw Ku Department of Mathematics, National University of Singapore, Singapore 117543 matkcy@nus.edu.sg Kok Bin Wong Institute of Mathematical Sciences, University
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 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 informationTHE (2k 1)-CONNECTED MULTIGRAPHS WITH AT MOST k 1 DISJOINT CYCLES
COMBINATORICA Bolyai Society Springer-Verlag Combinatorica 10pp. DOI: 10.1007/s00493-015-3291-8 THE (2k 1)-CONNECTED MULTIGRAPHS WITH AT MOST k 1 DISJOINT CYCLES HENRY A. KIERSTEAD*, ALEXANDR V. KOSTOCHKA,
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 informationINDEPENDENT TRANSVERSAL DOMINATION IN GRAPHS
Discussiones Mathematicae Graph Theory 32 (2012) 5 17 INDEPENDENT TRANSVERSAL DOMINATION IN GRAPHS Ismail Sahul Hamid Department of Mathematics The Madura College Madurai, India e-mail: sahulmat@yahoo.co.in
More informationGraphs with few total dominating sets
Graphs with few total dominating sets Marcin Krzywkowski marcin.krzywkowski@gmail.com Stephan Wagner swagner@sun.ac.za Abstract We give a lower bound for the number of total dominating sets of a graph
More informationErdős-Gallai-type results for the rainbow disconnection number of graphs
Erdős-Gallai-type results for the rainbow disconnection number of graphs Xuqing Bai 1, Xueliang Li 1, 1 Center for Combinatorics and LPMC arxiv:1901.0740v1 [math.co] 8 Jan 019 Nankai University, Tianjin
More informationarxiv: v1 [math.co] 3 Mar 2015 University of West Bohemia
On star-wheel Ramsey numbers Binlong Li Department of Applied Mathematics Northwestern Polytechnical University Xi an, Shaanxi 710072, P.R. China Ingo Schiermeyer Institut für Diskrete Mathematik und Algebra
More informationarxiv: v1 [math.co] 12 Jul 2017
A SHARP DIRAC-ERDŐS TYPE BOUND FOR LARGE GRAPHS H.A. KIERSTEAD, A.V. KOSTOCHKA, AND A. McCONVEY arxiv:1707.03892v1 [math.co] 12 Jul 2017 Abstract. Let k 3 be an integer, h k (G) be the number of vertices
More informationPacking and Covering Dense Graphs
Packing and Covering Dense Graphs Noga Alon Yair Caro Raphael Yuster Abstract Let d be a positive integer. A graph G is called d-divisible if d divides the degree of each vertex of G. G is called nowhere
More information12.1 The Achromatic Number of a Graph
Chapter 1 Complete Colorings The proper vertex colorings of a graph G in which we are most interested are those that use the smallest number of colors These are, of course, the χ(g)-colorings of G If χ(g)
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 information