Discrete Mathematics
|
|
- Darren Bishop
- 6 years ago
- Views:
Transcription
1 Discrete Mathematics 310 (2010) Contents lists available at ScienceDirect Discrete Mathematics journal homepage: Maximal cliques in {P 2 P 3, C }-free graphs S.A. Choudum, T. Karthick Department of Mathematics, Indian Institute of Technology Madras, Chennai , India a r t i c l e i n f o a b s t r a c t Article history: Received 28 January 2010 Received in revised form 19 July 2010 Accepted 12 August 2010 Available online 9 September 2010 Keywords: Chordal graphs C -free graphs Maximal cliques Chromatic number We prove a decomposition theorem for the class G of {P 2 P 3, C }-free graphs. This theorem enables us to show that (i) every graph G in G has at most n + 5 maximal cliques where n is the number of vertices in G, and (ii) for every G in G, χ(g), where χ(g) (ω(g)) is the chromatic (clique) number of G Elsevier B.V. All rights reserved. 1. Introduction All our graphs are simple, finite and undirected. For a graph G, let n and m, respectively denote the number of vertices and number of edges in G. A clique in a graph G is a set of pairwise adjacent vertices in G, and is maximal if it is not contained in a larger clique. We denote the number of maximal cliques in a graph G by µ(g). Moon and Moser [12] proved that µ(g) 3 n 3, for any graph G, and observed that this bound is attained by the graph ( t K 3 3) c, where t is a multiple of 3. A class of graphs G is said to have few cliques [1] if µ(g) p(n), for every G G, where p(n) denotes a polynomial in n. In 1965, Fulkerson and Gross [7] obtained an interesting characterization of interval graphs. During the course of their proof, they observed that any chordal graph has at most n maximal cliques. Since then several more classes of graphs with few cliques have been identified. These results are summarized in Table 1. It follows that the Maximum Clique Problem and the Maximum Weight Clique Problem for these classes of graphs are solvable in polynomial time, where as for a general class of graphs these problems are well known to be NP-complete. Various complexity issues on graphs with few cliques are investigated in [15]. For (P 2 P 3 )-free graphs, Maximum Independent Set Problem and Independent Dominating Set Problem are solvable in polynomial time [11] but Minimum Dominating Set Problem [1] and Maximum Clique Problem [13] are known to be NP-complete. In this paper, we are concerned with the class of {P 2 P 3, C }-free graphs, which includes interesting subclasses such as split graphs, pseudo-split graphs, {2K 2, C }-free graphs and {3K 1, C }-free graphs. See Fig. 1 for examples of graphs which are (i) {P 2 P 3, C }-free, (ii) (P 2 P 3 )-free but contains an induced C, and (iii) C -free but contains an induced (P 2 P 3 ). We prove a decomposition theorem for the class G of {P 2 P 3, C }-free graphs. This theorem enables us to show that (i) every graph G in G has at most n + 5 maximal cliques, where n is the number of vertices in G, and (ii) for every G in G, χ(g), where χ(g) (ω(g)) is the chromatic (clique) number of G. These extend the results proved in [2,3]. Throughout the paper, P t, C t, K t, respectively denote the induced path, induced cycle, complete graphs on t vertices. For notations and terminology not defined here, we follow West [17]. If H is an induced subgraph of G, we write H G. If H is Corresponding author. addresses: sac@iitm.ac.in (S.A. Choudum), karthick@smail.iitm.ac.in (T. Karthick) X/$ see front matter 2010 Elsevier B.V. All rights reserved. doi: /j.disc
2 S.A. Choudum, T. Karthick / Discrete Mathematics 310 (2010) Fig. 1. H 1 is a {P 2 P 3, C }-free graph, H 2 is a (P 2 P 3 )-free graph but contains an induced C, and H 3 is a C -free graph but contains an induced (P 2 P 3 ). Table 1 Classes of graphs with few cliques. G Upper bound for µ(g) Chordal n [7] C -free cn 2, c is a constant [6] {2K 2, C }-free n [2] {P 5, C }-free n [8] 7n Planar 3 [1] K t -free, t 2 max{n, n t 2 } [1] 2 t 2 {K 1,3, K 1 + C }-free 2m [9] Graph with boxicity k (2n) k [16] a subgraph of a graph G and if v V(G), then N H (v) = N G (v) V(H). If F is a family of graphs, G is said to be F -free if it contains no induced subgraph isomorphic to any graph in F. If S and T are two vertex disjoint subsets, then [S, T] denotes the set of edges with one end in S and the other in T. [S, T] is said to be complete if every vertex in S is adjacent with every vertex in T. [S] denotes the subgraph induced by S. The length of a shortest path between two vertices x, y is denoted by d(x, y), and d(x, S) := min{d(x, y) : y S}. For any integer i 0, N i (S) := {y V(G) : d(x, y) = i, for some x S}, and we simply denote it by N i. N 1 ({x}) is denoted by N(x), and N[x] = N(x) {x}. For a graph G, we denote a partition of V(G) into k ( 1) sets by (V 1, V 2,..., V k ). For a graph G, G c denotes the complement of G. If G 1 and G 2 are two vertex disjoint graphs, then their union G 1 G 2 is the graph with V(G 1 G 2 ) = V(G 1 ) V(G 2 ) and E(G 1 G 2 ) = E(G 1 ) E(G 2 ). Similarly, their join G 1 + G 2 is the graph with V(G 1 + G 2 ) = V(G 1 ) V(G 2 ) and E(G 1 + G 2 ) = E(G 1 ) E(G 2 ) {(x, y) : x V(G 1 ), y V(G 2 )}. For any positive integer k, kg denotes the union of k disjoint graphs each isomorphic with G. For a graph G, let χ(g) (ω(g)) denote its chromatic (clique) number. Next, we define an operation to combine various graphs. Let G be a graph on n vertices v 1, v 2,..., v n, and let H 1, H 2,..., H n be n vertex disjoint graphs. Then an expansion G(H 1, H 2,..., H n ) of G is the graph obtained from G by (i) replacing the vertex v i of G by H i, i = 1, 2,..., n, and (ii) joining the vertices x H i, y H j iff v i and v j are adjacent in G. An expansion is also called a composition; see [17]. If H i s are complete, it is called a complete expansion of G, and is denoted by K[G] or K[G](m 1, m 2,..., m n ) if H i = K mi. It is shown by Lovász [10] that if G, H 1, H 2,..., H n are perfect, then G(H 1, H 2,..., H n ) is perfect. So, if G is perfect, then K[G] is perfect. It is easily verified that if G is chordal, then K[G] is chordal, so in particular G + K t (t 0) is chordal. 2. The class of {P 2 P 3, C }-free graphs 2.1. Structure of {P 2 P 3, C }-free graphs In this section, we prove a decomposition theorem for a non-chordal {P 2 P 3, C }-free graph G which says that its vertex set V(G) can be partitioned into three subsets V 1, V 2 and V 3 such that [V 3 ] can be obtained as a complete expansion of one of the seventeen basic graphs shown in Fig. 2, and V 1 and V 2, respectively induce an edgeless graph and a complete graph. Theorem 1. A connected graph G that contains an induced C 6 is {P 2 P 3, C, C 5 }-free if and only if there exists a partition (V 1, V 2, V 3 ) of V(G) such that (1) [V 1 ] = K c m, for some m 0, (2) [V 2] = K t, for some t 0, (3) [V 3 ] = C 6, () [V 1, V 3 ] =, and (5) [V 2, V 3 ] is complete. Proof. Observe that if such a partition exists, then G is a {P 2 P 3, C, C 5 }-free graph that contains an induced C 6. To see the reverse implication, let us assume that [N 0 ] := [{v 1, v 2, v 3, v, v 5, v 6 }] = C 6 G. By assumptions on G, any x N 1 is adjacent to all the vertices of [N 0 ]. Then (i) [N 1 ] is complete (else, C G). (ii) N 2 is independent (else, P 2 P 3 G). (iii) N r =, if r 3 (else, P 2 P 3 G). It follows that (N 2, N 1, N 0 ) is a required partition of V(G).
3 300 S.A. Choudum, T. Karthick / Discrete Mathematics 310 (2010) Fig. 2. Basic graphs used in Theorem 2. Theorem 2. If G is a connected {P 2 P 3, C }-free graph, then G is either chordal or there exists a partition (V 1, V 2, V 3 ) of V(G) such that (1) [V 1 ] = K c m, for some m 0, (2) [V 2] = K t, for some t 0, (3) [V 3 ] is isomorphic to a graph obtained from one of the basic graphs G t (1 t 17) shown in Fig. 2 by expanding each vertex indicated in circle by a complete graph (of order 1), () [V 1, V 3 ] =, and (5) [V 2, V 3 \ S] is complete (see Fig. 2 for the set S). Proof. Let G be a connected {P 2 P 3, C }-free graph and for 1 t 17, let G t denote the class of graphs obtained from G t by the operations stated in the theorem. If G is {C 5, C 6 }-free, then G is chordal. If G is C 5 -free and contains an induced C 6, then a required partition is given by Theorem 1 where [V 3 ] = C 6 G 1 and S =. Hence, assume that G contains an induced C 5. Among all the induced 5-cycles in G, choose one, say C such that the number of vertices in V(G) \ V(C) that are adjacent to exactly two consecutive vertices of C is maximum. Let C = [N 0 ] = [{v 1, v 2, v 3, v, v 5 }] = C 5 G and let A = {x N 1 : [N(x) N 0 ] = K 1 }, B = {x N 1 : [N(x) N 0 ] = K 2 }, D = {x N 1 : [N(x) N 0 ] = P 3 }, F = {x N 1 : [N(x) N 0 ] = C 5 }. Then it is easily verified that N 1 = A B D F. For convenience, we further partition A, B and D as follows: A i = {x A : N(x) N 0 = {v i }}, B i = {x B : N(x) N 0 = {v i, v i+1 }}, D i = {x D : N(x) N 0 = {v i 1, v i, v i+1 }}, where 1 i 5, i mod 5. Then A = 5 i=1 A i, B = 5 i=1 B i, and D = 5 i=1 D i, and the following hold: (R1) N j =, for all j 3 (else, P 2 P 3 G); so V(G) = N 0 N 1 N 2. (R2) [A B D, N 2 ] = (else, P 2 P 3 G). For every i, 1 i 5, i mod 5, we have: (R3) (i) A i 1 (else, P 2 P 3 G). (ii) [A i, A i+1 ] = (else, C G).
4 S.A. Choudum, T. Karthick / Discrete Mathematics 310 (2010) (iii) [A i, A i+2 ] is complete (else, P 2 P 3 G). (iv) [A] is an induced subgraph of C 5 (a consequence of (i), (ii) and (iii)). (R) (i) B i 1 (else, P 2 P 3 G). (ii) [B i, B i+1 ] is complete (else, P 2 P 3 G). (iii) If B i, then B i+2 = = B i 2 (else, P 2 P 3 or C G). (iv) If B = 2, then B k, B k+1, for some k, 1 k 5, k mod 5 (a consequence of (iii)). (R5) (i) [D i ] is complete (else, C G). (ii) [D i, D i+2 ] = (else, C G). (iii) [D i, D i+1 ] is complete or there exist a unique d i D i and a unique d i+1 D i+1 such that d i d i+1 E(G) (else, P 2 P 3 or C G). In the latter case, D i+3 = (else, P 2 P 3 G). (iv) There exists a j, 1 j 5, j mod 5, such that [N 0 D] = K(C 5 ) Z, where Z {(d j, d j+1 ), (d, j+1 d j+2)} with d j D j, d j+1, d j+1 D j+1 (d j+1 d j+1 ) and d j+2 D j+2 ( a consequence of (i), (ii) and (iii)). (R6) (i) If A i, then B j =, for all j i + 2 (else, P 2 P 3 or C G). (ii) [A i, B i+2 ] is complete (else, P 2 P 3 G). (R7) (i) [A i, D i ] is complete (else, P 2 P 3 G). (ii) [A i, D i 1 ] = = [A i, D i+1 ] (else, P 2 P 3 G). (iii) If A i, then D i 2 = = D i+2 (else, P 2 P 3 or C G). (iv) If A i, then [D i, D i+1 ] and [D i, D i 1 ] are complete (else, P 2 P 3 G, by (i) and (ii)). (R8) (i) [B i, D j ] is complete, for all j i 2 (else, P 2 P 3 G). (ii) [B i, D i 2 ] = (else, C G). (iii) If B i, then either D i 1 = or D i+2 = (else, P 2 P 3 or C G). (iv) If B i, then [D i+1, D i+2 ] and [D i, D i 1 ] are complete (else, C G). (R9) [F] is complete (else, C G). (R10) [D i, F] is complete (else, C G). Hence, [N 0 D, F] is complete. (R11) N 2 is independent (else, P 2 P 3 G). (R12) (i) If x, y V(G) \ V(C) are such that xy E(G), and if there exists an index j (1 j 5, j mod 5) such that xv j, yv j 2 E(G) and xv j 2, yv j, xv j 1, yv j 1 E(G), then [{x, y}, F] is complete (else, P 2 P 3 or C G). (ii) If x, y A B and xy E(G), then N(x) F = N(y) F (else, C G). If we define V 1 = N 2, V 2 = F and V 3 = N 0 A B D, then the partition (V 1, V 2, V 3 ) of V(G) satisfies the following requirements of the theorem: (1) by (R11), (2) by (R9), () by (R2), and (5) by (R10) and (R12). So, the theorem is proved if we show that [V 3 ] satisfies (3). We will consider three cases depending on B. Note that B 2, by (R). Case 1: B = 0. If A =, we claim that the set Z defined in (R5(iv)) is empty. If not, (w. l. o. g.) assume that (d 1, d 2 ) Z. Then C := [{v 1, d 2, v 3, v, v 5 }] is an induced 5-cycle in G such that d 1 is adjacent to exactly two consecutive vertices v 1 and v 5 of C, a contradiction to the choice of C. So, by properties (R3), (R5) and (R7), we conclude that [V 3 ] = K(C 5 ) G 2, if A =, and [V 3 ] 9 G i=3 i, if A. Case 2: B = 1. Assume (w.l.o.g.) that B = {b 1 }. Then by (R6(i)), A i =, for all i {1, 2, 3, 5}. So, A = A 1. Also, by (R8(iii)), one of D 3 or D 5 is empty. Assume (w.l.o.g.) that D 5 =. Next, we claim that Z =. Assume to the contrary that Z. By (R8(iv)), Z = {(d 1, d 2 )} or Z = {(d 3, d )}. If Z = {(d 1, d 2 )}, then C := [{v 1, d 2, v 3, v, v 5 }] is an induced 5-cycle in G such that d 1 is adjacent to v 1 and v 5 of C, and b 1 is adjacent to v 1 and d 2 of C, a contradiction to the choice of C, and if Z = {(d 3, d )}, we get a similar contradiction. So, if A = 0, then by properties (R) and (R8), we see that [V 3 ] G 10 G 11. If A = 1, let A = A = {a }. By (R7(iii)), D 1 = = D 2. By (R6(ii)), [A, B 1 ] is complete. Then by using (R7(ii)) and (R8(i)), we see that D 3 = (else, C G). Since [A, D ] is complete (by R7(i)), these observations imply that [V 3 ] G 12. Case 3: B = 2. Assume (w.l.o.g.) that B = {b 1, b 2 }. Then by (R6(i)), A =. By (R8(iii)), we deduce that D 5 = or D 3 =, since B 1, and D 1 = or D =, since B 2. Hence one of the four sets D 1 D 5, D 5 D, D 3 D 1 or D D 3 is empty. So, if Z =, then since b 1 b 2 E(G) (by R(ii)), we see that one of D = or D 5 = (else, C G). Hence, by properties (R), (R5) and (R8), we conclude that [V 3 ] G 13 G 1 G 15, if D 1 D 5 = or D D 3 = or D 3 D 1 =, and [V 3 ] G 13 G 1 G 16, if D D 5 =. If Z, then by (R8(iv)), Z = {(d, d 5 )}. Now, we claim that D \ {d } = = D 5 \ {d 5 }. Assume to the contrary that d D \ {d }. Then b 1 b 2, d d 5, b 1 d 5, b 2 d E(G) (by R(ii), R5(iii), and R8(i)) and b 1d, b 2d 5 E(G) (by R8(ii)). But then [b 3, b, d, 1 d 2] = C G, a contradiction. So, D \ {d } =. Similarly, D 5 \ {d 5 } =. Thus, by properties (R), (R5) and (R8), and by the nature of Z, we conclude that [V 3 ] G 17. Corollary 1. If G is a connected {P 2 P 3, C }-free graph, then there exists a vertex v in G such that [N[v]] is chordal. Proof. If G is chordal, then [N[v]] is chordal, for all v V(G). If G is not chordal, then consider the partition (V 1, V 2, V 3 ) of V(G) described in Theorem 2. Let v V 3. It can be directly verified that [N Gj [v]] is chordal, for all j, 1 j 17. Moreover, [N G (v) V 2 ] is a complete graph. Thus, [N G (v)] is a complete expansion of [N Gj [v]] + K 1, where 1 j 17, and hence it is chordal. It follows that if G is a {P 2 P 3, C }-free graph (connected or disconnected), then there exists a vertex v such that [N[v]] is chordal.
5 302 S.A. Choudum, T. Karthick / Discrete Mathematics 310 (2010) Number of maximal cliques A universal vertex of a graph G is a vertex which is adjacent to all other vertices in G. For later use, we make the following simple observations and state a result due to Fulkerson and Gross [7]. (M1) µ(g 1 G 2 ) = µ(g 1 ) + µ(g 2 ). So, µ(g) = µ(g 1 ) + µ(g 2 ) + + µ(g k ), if G 1, G 2,..., G k are the components of G. (M2) µ(g 1 + G 2 ) = µ(g 1 ) µ(g 2 ). So, if T is a set of universal vertices in a graph G, then µ(g T) = µ(g). (M3) µ(k[g]) = µ(g). (M) If each vertex in G belongs to at most k maximal cliques, then µ(g) kn 2. Theorem A ([7]). If G is a chordal graph, then µ(g) n. Equality holds if and only if G has no edges. Theorem 3. If G is a {P 2 P 3, C }-free graph, then µ(g) n + 5. Proof. If G is chordal, then µ(g) n, by Theorem A. So, assume that G is not chordal. If G is connected, then V(G) admits a partition (V 1, V 2, V 3 ) as described in Theorem 2. Let T denote the set of all universal vertices in [V 2 V 3 ]. Note that T V 2. Then: µ(g) µ(g V 1 ) + V 1, since [V 1 ] is edgeless and every v V 1 is simplicial = µ(g V 1 T) + V 1, by (M2) = µ(g i ) + V 1, for some i, 1 i 17, by (M3) n + 5, since µ(g i ) V(G i ) + 5, for all i, 1 i 17. Next, assume that G is disconnected. Let F 1, F 2,..., F k denote the components of G. Since G is not chordal, at least one component, say F 1 admits a decomposition (V 1, V 2, V 3 ) of V(F 1 ) as given in Theorem 2 such that C 5 [V 3 ] or C 6 = [V3 ]. Since G is (P 2 P 3 )-free, for every i, 2 i k, F i is an edgeless graph and hence it has exactly one vertex. So, µ(g) = µ(f 1 ) + n V(F 1 ), by (M1) V(F 1 ) n V(F 1 ), by the above argument = n + 5. The upper bound given in Theorem 3 is attained for the graphs P K c t, where t 0 and P is the Petersen graph. Corollary 2. If G is a {K 1 + (P 2 P 3 ), K 1 + C }-free graph, then µ(g) n2 +5n. 2 Proof. Note that [N(x)] is {P 2 P 3, C }-free, for any x V(G). So, by Theorem 3, any x V(G) belong to at most n + 5 maximal cliques. Hence the result follows by (M). If G is a {K 1 + (P 2 P 3 ), K 1 + C }-free graph, then the upper bound for µ(g) in Corollary 2 has to be quadratic in n. For example, consider the graph H = C 5 (K c, t K c, t K c, t K c, t K c t ), which is {K 1 + (P 2 P 3 ), K 1 + C }-free and has 5t vertices. Since maximal cliques in H are edges, we have µ(h) = 5t 2. An O(n 2 m)-time algorithm to generate all the maximal cliques in a graph which repeatedly contains a vertex whose neighborhood is chordal is described in Section 2 of [5]. Therefore, by Corollary 1, we have the following result. Theorem. All the maximal cliques in a {P 2 P 3, C }-free graph can be generated in O(n 2 m)-time Chromatic bound Blászik et al. [2] proved that for every {2K 2, C }-free graph G, χ(g) ω(g) + 1. It is shown in [3] that if G is a {3K 1, C }- free graph, then χ(g). We prove that this latter bound holds for the class of {P 2 P 3, C }-free graphs, which is a superclass of both {2K 2, C }-free graphs and {3K 1, C }-free graphs. This bound is optimal; see [3] for optimal graphs. A graph G is said to be perfect if χ(h) = ω(h), for every induced subgraph H of G. The strong perfect graph theorem (SPGT) [] states that G is perfect if and only if G is {C 2k+1, C c 2k+1 }-free, for every k 2. The following assertions are easy consequences of SPGT []. Lemma 1. If G is a {P 2 P 3, C, C 5 }-free graph, then G is perfect. Lemma 2. If G is a graph which admits a partition (V 1, V 2, V 3 ) of V(G) such that (1) [V 1 ] is an edgeless graph, (2) [V 2 ] is complete, (3) [V 3 ] is perfect, () [V 1, V 3 ] =, and (5) [V 2, V 3 ] is complete, then G is perfect. Theorem 5. If G(V, E) is a {P 2 P 3, C }-free graph, then χ(g). Proof. Assume that G is connected. We use Theorem 2 to deduce the upper bound. If G is chordal, then G is perfect and so χ(g) = ω(g). Else, there exists a partition (V 1, V 2, V 3 ) of V(G) as described in Theorem 2.
6 S.A. Choudum, T. Karthick / Discrete Mathematics 310 (2010) If [V 3 ] G j, where 1 j 17, j 2, let T j G j be the independent set defined in Fig. 2. It is easily verified that G j T j is a perfect graph. So, [V 3 \T j ] is a complete expansion of a perfect graph. Hence, by Lemmas 1 and 2, G T j is perfect. Therefore, χ(g) χ(g T j ) + χ([t j ]) ω(g) + 1. Next suppose that [V 3 ] G 2. Then, [V 3 ] = K[C 5 ](m 1, m 2, m 3, m, m 5 ), where m i 1, for all i, 1 i 5; let m 1 = min{m i : 1 i 5}. Let V = 3 V(K[C 5](m 1, m 1, m 1, m 1, m 1 )). Then [V 3 V ] 3 is perfect. So, (V 1, V 2, V 3 V ) 3 is a partition of V(G V ) 3 as described in Lemma 2. Hence, G V 3 is perfect. Since ω([v ]) = 3 2m 1 and χ([v 1 V ]) = 5m (see [3]), we deduce that χ(g) χ([v (V 1 V )]) + 3 χ([v 1 V ]) 3 ω([v (V 1 V )]) + 5m1 3, since [V (V 1 V 3 2 )] G V, 3 and G V 3 is perfect 5m1 (ω(g) 2m 1 ) + 2, since 2m 1 ω(g). Acknowledgements The authors thank the referees for their valuable suggestions and comments. The second author acknowledges the CSIR, India for the financial support to carry out this research work. References [1] A.A. Bertossi, Dominating sets for split and bipartite graphs, Information Processing Letters 19 (198) [2] Z. Blázsik, M. Hujter, A. Pluhár, Z. Tuza, Graphs with no induced C and 2K 2, Discrete Mathematics 115 (1993) [3] S.A. Choudum, M.A. Shalu, The class of {3K 1, C }-free graphs, Australasian Journal of Combinatorics 32 (2005) [] M. Chudnovsky, P. Seymour, N. Robertson, R. Thomas, The strong perfect graph theorem, Annals of Mathematics 16 (1) (2006) [5] M.V.G. da Silva, K. Vušković, Triangulated neighborhoods in even-hole-free graphs, Discrete Mathematics 307 (2007) [6] M. Farber, On diameters and radii of bridged graphs, Discrete Mathematics 73 (1989) [7] D.R. Fulkerson, O. Gross, Incidence matrices and interval graphs, Pacific Journal of Mathematics 15 (1965) [8] J.L. Fouquet, V. Giakoumakis, F. Maire, H. Thuillier, On graphs without P 5 and P 5, Discrete Mathematics 16 (1995) 33. [9] T. Kloks, K 1,3 -free and W -free graphs, Information Processing Letters 60 (1996) [10] L. Lovász, A characterization of perfect graphs, Journal of Combinatorial Theory Series B 13 (1972) [11] V.V. Lozin, R. Mosca, Independent sets in extensions of 2K 2 -free graphs, Discrete Applied Mathematics 16 (2005) [12] J.W. Moon, L. Moser, On cliques in graphs, Israel Journal of Mathematics 3 (1965) [13] S. Poljak, A note on stable sets and colorings of graphs, Commentationes Mathematicae Universitatis Carolinae 15 (197) [1] E. Prisner, Graphs with few cliques, in: Proceedings of the 7th Quadrennial International Conference on the Theory and Applications of Graphs, 1992, in: Graph Theory, Combinatorics, and Applications, 1995, pp [15] B. Rosgen, L. Stewart, Complexity results on graphs with few cliques, Discrete Mathematics and Theoretical Computer Science 9 (2007) [16] J.P. Spinrad, Efficient graph representations, in: Fields Institute Monographs, vol. 19, American Mathematical Society, [17] D.B. West, Introduction to Graph Theory, 2nd Edition, Prentice-Hall, Englewood Cliffs, New Jersey, 2000.
Discrete Mathematics
Discrete Mathematics 311 (011) 911 90 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: www.elsevier.com/locate/disc Bounding χ in terms of ω and for some classes of graphs
More informationGraph coloring, perfect graphs
Lecture 5 (05.04.2013) Graph coloring, perfect graphs Scribe: Tomasz Kociumaka Lecturer: Marcin Pilipczuk 1 Introduction to graph coloring Definition 1. Let G be a simple undirected graph and k a positive
More informationONE-THREE JOIN: A GRAPH OPERATION AND ITS CONSEQUENCES
Discussiones Mathematicae Graph Theory 37 (2017) 633 647 doi:10.7151/dmgt.1948 ONE-THREE JOIN: A GRAPH OPERATION AND ITS CONSEQUENCES M.A. Shalu and S. Devi Yamini IIITD & M, Kancheepuram, Chennai-600127,
More informationColoring square-free Berge graphs
Coloring square-free Berge graphs Maria Chudnovsky Irene Lo Frédéric Maffray Nicolas Trotignon Kristina Vušković September 30, 2015 Abstract We consider the class of Berge graphs that do not contain a
More informationNote on equitable coloring of graphs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 59() (0), Pages 5 59 Note on equitable coloring of graphs T. Karthick Computer Science Unit Indian Statistical Institute Chennai Centre Chennai 600 India karthick@isichennai.res.in
More informationPartial characterizations of clique-perfect graphs I: subclasses of claw-free graphs
Partial characterizations of clique-perfect graphs I: subclasses of claw-free graphs Flavia Bonomo a,1, Maria Chudnovsky b,2 and Guillermo Durán c,3 a Departamento de Computación, Facultad de Ciencias
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 informationPerfect divisibility and 2-divisibility
Perfect divisibility and 2-divisibility Maria Chudnovsky Princeton University, Princeton, NJ 08544, USA Vaidy Sivaraman Binghamton University, Binghamton, NY 13902, USA April 20, 2017 Abstract A graph
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 informationInduced subgraphs of graphs with large chromatic number. I. Odd holes
Induced subgraphs of graphs with large chromatic number. I. Odd holes Alex Scott Mathematical Institute, University of Oxford, Oxford OX2 6GG, UK Paul Seymour 1 Princeton University, Princeton, NJ 08544,
More informationColoring graphs with forbidden induced subgraphs
Coloring graphs with forbidden induced subgraphs Maria Chudnovsky Abstract. Since graph-coloring is an NP -complete problem in general, it is natural to ask how the complexity changes if the input graph
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 informationThe structure of bull-free graphs I three-edge-paths with centers and anticenters
The structure of bull-free graphs I three-edge-paths with centers and anticenters Maria Chudnovsky Columbia University, New York, NY 10027 USA May 6, 2006; revised March 29, 2011 Abstract The bull is the
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 informationGRAPH MINORS AND HADWIGER S CONJECTURE
GRAPH MINORS AND HADWIGER S CONJECTURE DISSERTATION Presented in Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy in the Graduate School of The Ohio State University By Eliade
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 informationGraph Classes and Ramsey Numbers
Graph Classes and Ramsey Numbers Rémy Belmonte, Pinar Heggernes, Pim van t Hof, Arash Rafiey, and Reza Saei Department of Informatics, University of Bergen, Norway Abstract. For a graph class G and any
More informationTriangle-free graphs that do not contain an induced subdivision of K 4 are 3-colorable
Triangle-free graphs that do not contain an induced subdivision of K 4 are 3-colorable Maria Chudnovsky Princeton University, Princeton, NJ 08544 Chun-Hung Liu Princeton University, Princeton, NJ 08544
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 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 informationClaw-Free Graphs With Strongly Perfect Complements. Fractional and Integral Version.
Claw-Free Graphs With Strongly Perfect Complements. Fractional and Integral Version. Part II. Nontrivial strip-structures Maria Chudnovsky Department of Industrial Engineering and Operations Research Columbia
More informationCLIQUES IN THE UNION OF GRAPHS
CLIQUES IN THE UNION OF GRAPHS RON AHARONI, ELI BERGER, MARIA CHUDNOVSKY, AND JUBA ZIANI Abstract. Let B and R be two simple graphs with vertex set V, and let G(B, R) be the simple graph with vertex set
More information4-coloring P 6 -free graphs with no induced 5-cycles
4-coloring P 6 -free graphs with no induced 5-cycles Maria Chudnovsky Department of Mathematics, Princeton University 68 Washington Rd, Princeton NJ 08544, USA mchudnov@math.princeton.edu Peter Maceli,
More informationOn clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem
Theoretical Computer Science 389 (2007) 295 306 www.elsevier.com/locate/tcs On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem Andreas Brandstädt a, Chính T. Hoàng b,
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 informationOn Injective Colourings of Chordal Graphs
On Injective Colourings of Chordal Graphs Pavol Hell 1,, André Raspaud 2, and Juraj Stacho 1 1 School of Computing Science, Simon Fraser University 8888 University Drive, Burnaby, B.C., Canada V5A 1S6
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 informationThe structure of bull-free graphs II elementary trigraphs
The structure of bull-free graphs II elementary trigraphs Maria Chudnovsky Columbia University, New York, NY 10027 USA May 6, 2006; revised April 25, 2011 Abstract The bull is a graph consisting of a triangle
More informationThis is a repository copy of Chromatic index of graphs with no cycle with a unique chord.
This is a repository copy of Chromatic index of graphs with no cycle with a unique chord. White Rose Research Online URL for this paper: http://eprints.whiterose.ac.uk/74348/ Article: Machado, RCS, de
More informationThe Algorithmic Aspects of the Regularity Lemma
The Algorithmic Aspects of the Regularity Lemma N. Alon R. A. Duke H. Lefmann V. Rödl R. Yuster Abstract The Regularity Lemma of Szemerédi is a result that asserts that every graph can be partitioned in
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 informationOn rank-width of (diamond, even hole)-free graphs
Discrete Mathematics and Theoretical Computer Science DMTCS vol. 19:1, 2017, #24 On rank-width of (diamond, even hole)-free graphs Isolde Adler 1 Ngoc Khang Le 2,3 Haiko Müller 1 Marko Radovanović 4 Nicolas
More informationEvery line graph of a 4-edge-connected graph is Z 3 -connected
European Journal of Combinatorics 0 (2009) 595 601 Contents lists available at ScienceDirect European Journal of Combinatorics journal homepage: www.elsevier.com/locate/ejc Every line graph of a 4-edge-connected
More 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 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 informationClaw-free Graphs. III. Sparse decomposition
Claw-free Graphs. III. Sparse decomposition Maria Chudnovsky 1 and Paul Seymour Princeton University, Princeton NJ 08544 October 14, 003; revised May 8, 004 1 This research was conducted while the author
More informationInduced subgraphs of graphs with large chromatic number. VIII. Long odd holes
Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes Maria Chudnovsky 1 Princeton University, Princeton, NJ 08544, USA Alex Scott Mathematical Institute, University of Oxford,
More informationTriangle-free graphs with no six-vertex induced path
Triangle-free graphs with no six-vertex induced path Maria Chudnovsky 1, Paul Seymour 2, Sophie Spirkl Princeton University, Princeton, NJ 08544 Mingxian Zhong Columbia University, New York, NY 10027 June
More informationDiscrete Applied Mathematics
Discrete Applied Mathematics 159 (2011) 1345 1351 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam On disconnected cuts and separators
More informationEven Pairs and Prism Corners in Square-Free Berge Graphs
Even Pairs and Prism Corners in Square-Free Berge Graphs Maria Chudnovsky Princeton University, Princeton, NJ 08544 Frédéric Maffray CNRS, Laboratoire G-SCOP, University of Grenoble-Alpes, France Paul
More informationC-Perfect K-Uniform Hypergraphs
C-Perfect K-Uniform Hypergraphs Changiz Eslahchi and Arash Rafiey Department of Mathematics Shahid Beheshty University Tehran, Iran ch-eslahchi@cc.sbu.ac.ir rafiey-ar@ipm.ir Abstract In this paper we define
More informationThis is a repository copy of Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences.
This is a repository copy of Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences. White Rose Research Online URL for this paper: http://eprints.whiterose.ac.uk/74350/
More informationBerge Trigraphs. Maria Chudnovsky 1 Princeton University, Princeton NJ March 15, 2004; revised December 2, Research Fellow.
Berge Trigraphs Maria Chudnovsky 1 Princeton University, Princeton NJ 08544 March 15, 2004; revised December 2, 2005 1 This research was partially conducted during the period the author served as a Clay
More informationA Note on Roman {2}-domination problem in graphs
A Note on Roman {2}-domination problem in graphs arxiv:1804.09338v3 [math.co] 17 Feb 2019 Hangdi Chen and Changhong Lu School of Mathematical Sciences, Shanghai Key Laboratory of PMMP, East China Normal
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 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 informationBlockers for the stability number and the chromatic number
Blockers for the stability number and the chromatic number C. Bazgan C. Bentz C. Picouleau B. Ries Abstract Given an undirected graph G = (V, E) and two positive integers k and d, we are interested in
More informationTree-chromatic number
Tree-chromatic number Paul Seymour 1 Princeton University, Princeton, NJ 08544 November 2, 2014; revised June 25, 2015 1 Supported by ONR grant N00014-10-1-0680 and NSF grant DMS-1265563. Abstract Let
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 informationOn Dominator Colorings in Graphs
On Dominator Colorings in Graphs Ralucca Michelle Gera Department of Applied Mathematics Naval Postgraduate School Monterey, CA 994, USA ABSTRACT Given a graph G, the dominator coloring problem seeks a
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 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 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 informationHanna Furmańczyk EQUITABLE COLORING OF GRAPH PRODUCTS
Opuscula Mathematica Vol. 6 No. 006 Hanna Furmańczyk EQUITABLE COLORING OF GRAPH PRODUCTS Abstract. A graph is equitably k-colorable if its vertices can be partitioned into k independent sets in such a
More 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 informationIndependent Transversal Dominating Sets in Graphs: Complexity and Structural Properties
Filomat 30:2 (2016), 293 303 DOI 10.2298/FIL1602293A Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat Independent Transversal Dominating
More informationThe Computational Complexity of Graph Contractions I: Polynomially Solvable and NP-Complete Cases*
The Computational Complexity of Graph Contractions I: Polynomially Solvable and NP-Complete Cases* Asaf Levin Department of Statistics, The Hebrew University, Jerusalem 91905, Israel Daniel Paulusma Department
More informationTheoretical Computer Science
Theoretical Computer Science 532 (2014) 64 72 Contents lists available at SciVerse ScienceDirect Theoretical Computer Science journal homepage: www.elsevier.com/locate/tcs Bandwidth consecutive multicolorings
More informationInduced subgraphs of graphs with large chromatic number. VIII. Long odd holes
Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes Maria Chudnovsky 1 Princeton University, Princeton, NJ 08544, USA Alex Scott Mathematical Institute, University of Oxford,
More informationApplied Mathematics Letters
Applied Mathematics Letters 23 (2010) 1295 1300 Contents lists available at ScienceDirect Applied Mathematics Letters journal homepage: www.elsevier.com/locate/aml The Roman domatic number of a graph S.M.
More informationA taste of perfect graphs
A taste of perfect graphs Remark Determining the chromatic number of a graph is a hard problem, in general, and it is even hard to get good lower bounds on χ(g). An obvious lower bound we have seen before
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 informationACO Comprehensive Exam March 17 and 18, Computability, Complexity and Algorithms
1. Computability, Complexity and Algorithms (a) Let G(V, E) be an undirected unweighted graph. Let C V be a vertex cover of G. Argue that V \ C is an independent set of G. (b) Minimum cardinality vertex
More informationEvery 4-connected line graph of a quasi claw-free graph is hamiltonian connected
Discrete Mathematics 308 (2008) 532 536 www.elsevier.com/locate/disc Note Every 4-connected line graph of a quasi claw-free graph is hamiltonian connected Hong-Jian Lai a, Yehong Shao b, Mingquan Zhan
More informationExact Algorithms for Dominating Induced Matching Based on Graph Partition
Exact Algorithms for Dominating Induced Matching Based on Graph Partition Mingyu Xiao School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu 611731,
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 informationGraphical Model Inference with Perfect Graphs
Graphical Model Inference with Perfect Graphs Tony Jebara Columbia University July 25, 2013 joint work with Adrian Weller Graphical models and Markov random fields We depict a graphical model G as a bipartite
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 informationProbe interval graphs and probe unit interval graphs on superclasses of cographs
Author manuscript, published in "" Discrete Mathematics and Theoretical Computer Science DMTCS vol. 15:2, 2013, 177 194 Probe interval graphs and probe unit interval graphs on superclasses of cographs
More informationWheel-free planar graphs
Wheel-free planar graphs Pierre Aboulker Concordia University, Montréal, Canada email: pierreaboulker@gmail.com Maria Chudnovsky Columbia University, New York, NY 10027, USA e-mail: mchudnov@columbia.edu
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 informationarxiv: v1 [cs.dm] 6 Sep 2013
Combinatorial optimization with 2-joins arxiv:1309.1547v1 [cs.dm] 6 Sep 2013 Nicolas Trotignon and Kristina Vušković July 4, 2011 Abstract A 2-join is an edge cutset that naturally appears in decomposition
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 informationEnumerating minimal connected dominating sets in graphs of bounded chordality,
Enumerating minimal connected dominating sets in graphs of bounded chordality, Petr A. Golovach a,, Pinar Heggernes a, Dieter Kratsch b a Department of Informatics, University of Bergen, N-5020 Bergen,
More informationIndependent Transversals in r-partite Graphs
Independent Transversals in r-partite Graphs Raphael Yuster Department of Mathematics Raymond and Beverly Sackler Faculty of Exact Sciences Tel Aviv University, Tel Aviv, Israel Abstract Let G(r, n) denote
More informationarxiv: v1 [cs.dm] 4 May 2018
Connected greedy colouring in claw-free graphs arxiv:1805.01953v1 [cs.dm] 4 May 2018 Ngoc Khang Le and Nicolas Trotignon November 9, 2018 Abstract An ordering of the vertices of a graph is connected if
More informationThe edge-density for K 2,t minors
The edge-density for K,t minors Maria Chudnovsky 1 Columbia University, New York, NY 1007 Bruce Reed McGill University, Montreal, QC Paul Seymour Princeton University, Princeton, NJ 08544 December 5 007;
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 informationTree-width. September 14, 2015
Tree-width Zdeněk Dvořák September 14, 2015 A tree decomposition of a graph G is a pair (T, β), where β : V (T ) 2 V (G) assigns a bag β(n) to each vertex of T, such that for every v V (G), there exists
More informationM-saturated M={ } M-unsaturated. Perfect Matching. Matchings
Matchings A matching M of a graph G = (V, E) is a set of edges, no two of which are incident to a common vertex. M-saturated M={ } M-unsaturated Perfect Matching 1 M-alternating path M not M M not M M
More information2 β 0 -excellent graphs
β 0 -excellent graphs A. P. Pushpalatha, G. Jothilakshmi Thiagarajar College of Engineering Madurai - 65 015 India Email: gjlmat@tce.edu, appmat@tce.edu S. Suganthi, V. Swaminathan Ramanujan Research Centre
More informationPrecoloring extension on chordal graphs
Precoloring extension on chordal graphs Dániel Marx 17th August 2004 Abstract In the precoloring extension problem (PrExt) we are given a graph with some of the vertices having a preassigned color and
More informationOn a list-coloring problem
On a list-coloring problem Sylvain Gravier Frédéric Maffray Bojan Mohar December 24, 2002 Abstract We study the function f(g) defined for a graph G as the smallest integer k such that the join of G with
More informationSome operations preserving the existence of kernels
Discrete Mathematics 205 (1999) 211 216 www.elsevier.com/locate/disc Note Some operations preserving the existence of kernels Mostafa Blidia a, Pierre Duchet b, Henry Jacob c,frederic Maray d;, Henry Meyniel
More 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 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 informationPartial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs
Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs Flavia Bonomo a,d,1, Guillermo Durán c,b,2, Francisco Soulignac, a,1,3 and Gabriel Sueiro a,1 a
More informationCliques and Clubs.
Cliques and Clubs Petr A. Golovach 1, Pinar Heggernes 1, Dieter Kratsch 2, and Arash Rafiey 1 1 Department of Informatics, University of Bergen, Norway, {petr.golovach,pinar.heggernes,arash.rafiey}@ii.uib.no
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 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 informationColoring. Basics. A k-coloring of a loopless graph G is a function f : V (G) S where S = k (often S = [k]).
Coloring Basics A k-coloring of a loopless graph G is a function f : V (G) S where S = k (often S = [k]). For an i S, the set f 1 (i) is called a color class. A k-coloring is called proper if adjacent
More 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 informationMINIMALLY NON-PFAFFIAN GRAPHS
MINIMALLY NON-PFAFFIAN GRAPHS SERGUEI NORINE AND ROBIN THOMAS Abstract. We consider the question of characterizing Pfaffian graphs. We exhibit an infinite family of non-pfaffian graphs minimal with respect
More informationON GENERALIZED ZERO-DIVISOR GRAPH ASSOCIATED WITH A COMMUTATIVE RING
ITALIAN JOURNAL OF PURE AND APPLIED MATHEMATICS N. 39 2018 (128 139) 128 ON GENERALIZED ZERO-DIVISOR GRAPH ASSOCIATED WITH A COMMUTATIVE RING N. Jahanbakhsh Basharlou Department of Mathematics Karaj Branch
More informationDisjoint paths in unions of tournaments
Disjoint paths in unions of tournaments Maria Chudnovsky 1 Princeton University, Princeton, NJ 08544, USA Alex Scott Mathematical Institute, University of Oxford, Oxford OX2 6GG, UK Paul Seymour 2 Princeton
More informationarxiv: v2 [cs.dm] 2 Feb 2016
The VC-Dimension of Graphs with Respect to k-connected Subgraphs Andrea Munaro Laboratoire G-SCOP, Université Grenoble Alpes arxiv:130.6500v [cs.dm] Feb 016 Abstract We study the VC-dimension of the set
More informationUniquely 2-list colorable graphs
Discrete Applied Mathematics 119 (2002) 217 225 Uniquely 2-list colorable graphs Y.G. Ganjali a;b, M. Ghebleh a;b, H. Hajiabolhassan a;b;, M. Mirzazadeh a;b, B.S. Sadjad a;b a Institute for Studies in
More 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 informationLarge Cliques and Stable Sets in Undirected Graphs
Large Cliques and Stable Sets in Undirected Graphs Maria Chudnovsky Columbia University, New York NY 10027 May 4, 2014 Abstract The cochromatic number of a graph G is the minimum number of stable sets
More informationGRAPHS WITH MAXIMAL INDUCED MATCHINGS OF THE SAME SIZE. 1. Introduction
GRAPHS WITH MAXIMAL INDUCED MATCHINGS OF THE SAME SIZE PHILIPPE BAPTISTE, MIKHAIL Y. KOVALYOV, YURY L. ORLOVICH, FRANK WERNER, IGOR E. ZVEROVICH Abstract. A graph is well-indumatched if all its maximal
More information