This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
|
|
- Hope Rogers
- 6 years ago
- Views:
Transcription
1 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 and sharing with colleagues. Other uses, including reproduction and distribution, or selling or licensing copies, or posting to personal, institutional or third party websites are prohibited. In most cases authors are permitted to post their version of the article (e.g. in Word or Tex form) to their personal website or institutional repository. Authors requiring further information regarding Elsevier s archiving and manuscript policies are encouraged to visit:
2 Electronic Notes in Discrete Mathematics 35 (2009) Cycle transversals in bounded degree graphs M. Groshaus a,2,3 P. Hell b,3 S. Klein c,1,3 L. T. Nogueira d,1,3 F. Protti c,d,1,3 a Universidad de Buenos Aires, FCEyN, Dpto de Computación,CONICET,Argentina b Simon Fraser University, Canada c Universidade Federal do Rio de Janeiro (UFRJ), Brazil. d Universidade Federal Fluminense (UFF), Brazil. Abstract In this work we consider the problem of finding a minimum C k -transversal (a subset of vertices hitting all the induced chordless cycles with k vertices) in a graph with bounded maximum degree. In particular, we seek for dichotomy results as follows: for a fixed value of k, finding a minimum C k -transversal is polynomial-time solvable if k p, andnp-hard otherwise. Keywords: transversal, H-transversal, H-subgraph, H-free graph 1 Introduction The graphs considered in this work are simple, connected and finite. Let H be a fixed family of graphs. An H-subgraph of a graph G is an induced subgraph of G isomorphic to a member of H. A graph is H-free if it contains no H-subgraph. An H-transversal of a graph G is a subset T V (G) such that T intersects all the H-subgraphs of G. Clearly, if T is an H-transversal of G then G T is H-free. Moreover, if T is small (minimum) then G T is a large (maximum) induced H-free subgraph of G. For a fixed family H, the general decision problem named H-transversal can be formulated as follows: given a graph G andanintegerl, decide whether G contains an H-transversal T such that T l. Yannakakis proved that this problem is NP-complete [6]. Many problems in graphs can be considered in the context of transversals. For example, if H = {C 2k+1 k 0}, then H-transversal corresponds to the maximum induced bipartite subgraph problem. The table below shows known examples. Some references for this table are [1,2,3,4,5,6]. In the table, T denotes an H-transversal of G. 1 Partially supported by Brazilian agencies CNPq and FAPERJ. 2 Partially supported by UBACyT Grants X456, Cod X143 PICT ANCyT Grant E-addresses: groshaus@dc.uba.ar, pavol@cs.sfu.ca, sula@cos.ufrj.br, {loana,fabio}@ic.uff.br /$ see front matter 2009 Elsevier B.V. All rights reserved. doi: /j.endm
3 190 M. Groshaus et al. / Electronic Notes in Discrete Mathematics 35 (2009) G H G T general odd cycles bipartite general {K 2 } stable set general {K 3 } triangle-free general {P 3 } disjoint union of cliques general {P 4 } cograph chordal {K 3 } forest interval {K 1,3 } indifference bipartite {P 4 } disjoint union of bicliques chordal bipartite {C 4 } forest perfect {K l } (l 1)-colorable Let k denote a fixed integer, k 3. In this work we investigate the case H = {C k }. (C k denotes a chordless cycle with k vertices.) We consider the following problem, named C k - transversal: given a graph G (with bounded maximum degree Δ) and an integer l, doesg contain a C k -transversal of size at most l? In particular, we seek for dichotomy results as follows: for a fixed value of Δ, C k -transversal is polynomial-time solvable if k p, and NP-complete otherwise. Alternatively, we can fix k and determine p such that C k -transversal is polynomial-time solvable if Δ p, and NPcomplete otherwise. The table below summarizes the complexity results dealt with in this work. Δ=2 Δ=3 Δ 4 k =3 P P NP-c k =4 P P NP-c k 5 P NP-c NP-c If Δ = 2, minimum C k -transversals are trivially obtained in polynomial time for any k, since in this case the input graph is a disjoint union of paths and cycles. In Section 2, we show that C k -transversal for maximum degree three graphs is polynomial-time solvable for k 4 and NP-complete otherwise. For maximum degree four graphs, such a dichotomy is not possible: we show in Section 3 that C k -transversal is NP-complete for any fixed k 3. This NP-completeness result trivially extends to Δ 5. In view of the hardness of finding minimum C 3 -transversals (or triangle-transversals) for Δ = 4, polynomial cases and ideas for an approximation algorithm are presented in Section 3, where we describe a decomposition theorem for maximum degree four graphs and reduction rules. 2 Maximum degree three graphs An edge e E(G) is called a k-free edge if e is contained in no induced C k of G. Theorem 2.1 C 3 -transversal is polynomial time solvable for maximum degree three graphs. Proof. Let G with Δ = 3. Clearly, if e is a 3-free edge of G then T is a triangle-transversal
4 M. Groshaus et al. / Electronic Notes in Discrete Mathematics 35 (2009) of G if and only if T is a triangle-transversal of G e. Thus, to find a minimum triangletransversal of G, first remove 3-free edges; next, observe that each connected component of the remaining graph can be a triangle, a K 4 or a diamond (K 4 minus one edge). Hence a minimum triangle-transversal consists of one vertex per component. A4-bracelet is a cubic graph with vertex set V = {a 1,...,a j,b 1,...,b j } and edge set E = {a i b i 1 i j} {a i a i+1,b i b i+1 1 i j 1} {a 1 a j,b 1 b j }.Atwisted 4-bracelet is defined similarly, with edges a 1 b j,b 1 a j instead of a 1 a j,b 1 b j. Theorem 2.2 C 4 -transversal is polynomial time solvable for maximum degree three graphs. Proof. The result follows from the fact that a graph G with V (G) 6, Δ = 3 and containing no 4-free edges is a subgraph (not necessarily induced) of a bracelet or twisted bracelet. The next result completes the dichotomy for Δ = 3: Theorem 2.3 C k -transversal is NP-complete for maximum degree three graphs, for any fixed k 5. 3 Maximum degree four graphs For graphs with maximum degree four, we have: Theorem 3.1 C k -transversal is NP-complete for maximum degree four graphs, for any fixed k 3. Anaïve k-approximation algorithm is possible for finding C k -transversals in general graphs, for a fixed k 3. Given a graph G, initially set T = and C :=. At each step: (i) locate an induced C k,sayc (which can be found in polynomial time, since k is fixed); (ii) set T := T V (C) andc := C {C}; (iii) remove the vertices in V (C) fromg. Repeat (i) (iii) until there are no more C k s. Observe that the collection C is a C k -packing, thatis, a collection of vertex-disjoint C k s. Also, T is clearly a C k -transversal. If T is a minimum C k -transversal, we have T C. Since T = k C, it follows that T / T k. The above naïve algorithm produces triangle-transversals with size at most three times the optimum. Nonetheless, better behaviors might be achieved after applying some reductions on a maximum degree four input graph. We need the following definitions. A tie is a graph formed by five vertices a, b, c, d, z where d(z) =4anda, b, c, d induce 2K 2. The vertex z is called a bond. A piece is a maximum degree four connected graph containing no 3-free edges and no bonds. The following theorem characterizes pieces. Theorem 3.2 Let G be a piece. Then G is one of the graphs in Figure 1. The proof of Theorem 3.2 is a consequence of the following two lemmas. A piece G is said to be minimal if G z is not a piece for any z V (G).
5 192 M. Groshaus et al. / Electronic Notes in Discrete Mathematics 35 (2009) H (n 3) n H (n 7) n G G G G G G G G G G G G Fig. 1. Pieces. The graph H n (n 3) is formed by two paths u 1 u 2...u n/2 and v 1 v 2...v n/2,plus the following edges: u i v i and u i v i+1,1 i n/2 1; u n/2 v n/2 ; and, if n is odd, u n/2 v n/2. The graph H n (n 7) is formed by a copy of H n plus the following edges: v 1 u n/2 ; v 1 v n/2 ;and u 1 v n/2 (if n is even) or u 1 v n/2 (if n is odd). Lemma 3.3 If G is a minimal piece then either G = H 3 or G = H n, for n 7. Lemma 3.4 If G is a non-minimal piece then G is one of the graphs H n (n 4),G 4, G 5i (1 i 5), G 6j (1 j 5), G 7. A direct consequence of Theorem 3.2 is: Corollary 3.5 Let G be a maximum degree four graph containing no bonds. Then a minimum triangle-transversal of G can be obtained in polynomial time. Proof. After removing the 3-free edges of G, each of its connected components is a piece, for which a minimum triangle-transversal is easily obtained. We analyze now maximum degree four graphs that may contain bonds. We can restrict our analysis to connected graphs without 3-free edges. The following definition describes a decomposition for such graphs: Definition 3.6 Let G be a maximum degree four connected graph without 3-free edges. The piece decomposition of G is the collection of pieces obtained by splitting each bond of
6 M. Groshaus et al. / Electronic Notes in Discrete Mathematics 35 (2009) G into two vertices, each having two adjacent neighbors, as shown in Figure 2. Each piece of the collection is also said to be a piece of G. Fig. 2. Piece decomposition. A piece decomposition of G can be obtained in polynomial time by locating its bonds. Definition 3.7 Let G be a piece and v V (G). If d(v) = 2 then v is called a connector, otherwise an inner vertex. The template of G is a sequence (t 0,t 1,...,t k ) such that: (i) k is the number of connectors of G; (ii) if G is a piece of a graph H with minimum triangletransversal T,andi is the number of connectors of G belonging to T, then t i is the number of inner vertices of G belonging to T (observe that, for every piece, t i depends only on i, i.e., this value is independent of which group of i connectors lies in T ). For example, the templates of G 55 and G 61 are, respectively, (1, 1, 1, 0) and (2, 1, 1, 1). The template of H n,forn 4, depends on the value of n: if n =3j then it is ( n, n 3, n 3 ); if n =3j + 1 then it is ( n 1, n 1, n 4 n 2 ); and if n =3j + 2 then it is (, n 2, n 2) The piece H 3 is special, since all of its vertices are connectors and the case i = 0 cannot occur for it. To be coherent with Definition 3.7, the template of H 3 is (1, 0, 0, 0). Templates will be helpful to describe reduction rules that eliminate almost all types of pieces of a maximum degree four input graph G. Reduction rules. Let G be a maximum degree four connected graph without 3-free edges. Perform the piece decomposition of G. LetT be a minimum triangle-transversal of G to be computed, initially empty. 1. If G contains only one bond and only one piece then G is a 3-bracelet, a graph obtained from H n (for n 8) by collapsing its degree-two vertices. In this case, T is easily obtained. (In the cases below, G is not a 3-bracelet, therefore every piece of G is an induced subgraph of G.) 2. If G contains G 4 as a piece then G = G 4, since G 4 contains no connectors; hence, T can be trivially obtained. The same argument applies to G 51,G 53,G 54,G 63,G 64 and H n,for
7 194 M. Groshaus et al. / Electronic Notes in Discrete Mathematics 35 (2009) n 7. Thus we can exclude these pieces from consideration. 3. For each piece H of G isomorphic to G 52, choose two inner vertices v, w V (H), one of them with degree four. Include v, w in T, and remove from G all the inner vertices of H. An analogous procedure can be applied to any piece isomorphic to G 65, provided that v, w are not adjacent to a same connector of H. 4. For each piece H of G isomorphic to G 62,letv be the connector of H and w the inner vertex of H whose neighbors induce C 4. Include v, w in T, and remove all the vertices of H from G (including v). Update the piece decomposition of G by removing v from another piece of G containing it. 5. The templates of G 7 and H 7 are identical. Thus, transform every piece H of G isomorphic to G 7 into another piece isomorphic to H 7, as follows: if v and w are the connectors of H, and xy is an edge of H such that x is adjacent to v and y is adjacent to w, then remove xy from G. 6. The template of G 61 is (2, 1, 1, 1). Note that it can be obtained by adding one to each t i in the template of H 3.Thus,ifH is a piece of G isomorphic to G 61 where v, w, x are its inner vertices, construct a graph G by removing v, w, x and adding the edges vw, vx, wx. This corresponds to replacing H by a copy of H 3. It is easy to see that there exists a triangle-transversal of G with size q if and only if there exists a triangle-transversal of G with size q +1. Thus,G 61 can be excluded from consideration. 7. For n =3j +2(j 1), the template of H n saysthatthenumberofinnerverticesto be included in T is always the same. Thus, for each piece H isomorphic to H 3j+2 for some j 1, include in T a suitable subset of j inner vertices of H, and remove from G all the inner vertices of H. (In the case of H 5, for instance, the degree-four inner vertex must be included in T.) 8. For n =3j +1(j 2) the template of H n can be obtained by adding j 1toeacht i in thetemplateofh 4.Thus,ifH is a piece of G isomorphic to H 3j+1 for some j 2, construct agraphg by first removing all the inner vertices of H except the two neighbors v, w of some connector of H, and next linking v, w to the other connector of H. This corresponds to replacing H by a copy of H 4. Again, it is easy to see that there exists a triangle-transversal of G with size q if and only if there exists a triangle-transversal of G with size q + j 1. Thus, H 3j+1,forj 2, can also be excluded from consideration. 9. For n =3j (j 2) the template of H n can be obtained by adding j 1toeacht i in the template of H 3 (for i 2). Thus, if H is a piece of G isomorphic to H 3j for some j 2, construct a graph G by first removing all the inner vertices of H, and next creating a triangle using the connectors of H together with a new vertex x. This corresponds to replacing H by a copy of H 3. Since x is a degree-two vertex, we can assume that x/ T. Hence, there exists a triangle-transversal of G with size q if and only if there exists a triangle-transversal of G with size q + j 1. Thus, H 3j,forj 2, can also be excluded from consideration. 10. At this point, the original graph G may have been converted into a disconnected graph; then we deal with each connected component separately. Hence, let G still stand for a connected graph. The only possible pieces of G are now H 3, H 4 and G 55. In fact, we can
8 M. Groshaus et al. / Electronic Notes in Discrete Mathematics 35 (2009) eliminate H 4 by adding, for each piece isomorphic to H 4 with inner vertices v and w, new vertices x, y, z and new edges xv, xw, xy, xz, yz. That is, the only pieces of G are now H 3 and G 55 (called crown). At this point, let us call G reduced graph. The application of the rules is completed. We remark that the maximum degree four graph constructed in the reduction of Theorem 3.1 contains only triangles and crowns as pieces. Hence, C 3 -transversal remains NP-complete for maximum degree four graphs containing only such pieces. By excluding the crowns, we have the following result: Theorem 3.8 C 3 -transversal is polynomial time solvable for a maximum degree four graph G when its reduced graph contains no piece isomorphic to a crown. Proof. Let G be the reduced graph of G. Construct an intersection graph P(G ) as follows: the pieces of G (triangles) are the vertices of P(G ), and two vertices of P(G )areadjacent if they share a bond of G. Take a maximum matching M of P(G ). Let S be the subset of M-unsaturated vertices of G. An optimal triangle-transversal T of G is formed as follows: for each edge e M, include in T the corresponding bond of G, and for each vertex of S include in T any vertex of the corresponding piece of G. We are currently analyzing the performance of the following approximation algorithm: given the reduced graph G, for each crown C whose degree four vertices are u C and v C, include u C in T and remove u C,v C from G. Apply to the resulting graph the method described in Theorem 3.8. References [1] D. Cornaz and A. R. Mahjoub. The maximum induced bipartite subgraph problem with edge weights. Submitted manuscript. [2] P. C. Fishburn. Interval Orders and Interval Graphs. Wiley, New York, [3] M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York, [4]M.C.Golumbic.Algorithmic Graph Theory and Perfect Graphs. Wiley, New York, [5] G. Manic and Y. Wakabayashi. Packing triangles in low-degree graphs and indifference graphs. Proc. European Conference on Combinatorics, Graph Theory and Applications (EuroComb 05), Berlin, Germany, Discrete Mathematics and Theoretical Computer Science (DMTCS), Vol. AE 2005, pp [6] M. Yannakakis. Node- and edge-deletion NP-complete problems. Proc. of the Tenth Annual ACM Symposium on Theory of Computing STOC 78, pp , 1978, ACM Press.
arxiv: v3 [cs.dm] 18 Oct 2017
Decycling a Graph by the Removal of a Matching: Characterizations for Special Classes arxiv:1707.02473v3 [cs.dm] 18 Oct 2017 Fábio Protti and Uéverton dos Santos Souza Institute of Computing - Universidade
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 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 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 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 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 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 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 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 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 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 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 informationThis article was published in an Elsevier journal. The attached copy is furnished to the author for non-commercial research and education use, including for instruction at the author s institution, sharing
More informationThe maximum edge biclique problem is NP-complete
The maximum edge biclique problem is NP-complete René Peeters Department of Econometrics and Operations Research Tilburg University The Netherlands April 5, 005 File No. DA5734 Running head: Maximum edge
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 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 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 education use, including for instruction at the authors institution
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 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 information(This is a sample cover image for this issue. The actual cover is not yet available at this time.)
This is a sample cover image for this issue. The actual cover is not yet available at this time.) This article appeared in a journal published by Elsevier. The attached copy is furnished to the author
More informationOn 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 informationComplexity of conditional colorability of graphs
Complexity of conditional colorability of graphs Xueliang Li 1, Xiangmei Yao 1, Wenli Zhou 1 and Hajo Broersma 2 1 Center for Combinatorics and LPMC-TJKLC, Nankai University Tianjin 300071, P.R. China.
More 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 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 informationApproximation algorithms and hardness results for the clique packing problem. October, 2007
Approximation algorithms and hardness results for the clique packing problem F. Chataigner 1 G. Manić 2 Y.Wakabayashi 1 R. Yuster 3 1 Instituto de Matemática e Estatística Universidade de São Paulo, SP,
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 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 informationDept. of Computer Science, University of British Columbia, Vancouver, BC, Canada.
EuroComb 2005 DMTCS proc. AE, 2005, 67 72 Directed One-Trees William Evans and Mohammad Ali Safari Dept. of Computer Science, University of British Columbia, Vancouver, BC, Canada. {will,safari}@cs.ubc.ca
More informationPartitioning a Graph into Disjoint Cliques and a Triangle-free Graph arxiv: v6 [cs.cc] 4 Jan 2015
Partitioning a Graph into Disjoint Cliques and a Triangle-free Graph arxiv:1403.5961v6 [cs.cc] 4 Jan 2015 Faisal N. Abu-Khzam, Carl Feghali, Haiko Müller January 6, 2015 Abstract A graph G = (V, E) is
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution
More informationOn 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 informationDiscrete Applied Mathematics
Discrete Applied Mathematics ( ) Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam On the forbidden induced subgraph sandwich problem
More informationarxiv: v1 [cs.ds] 2 Oct 2018
Contracting to a Longest Path in H-Free Graphs Walter Kern 1 and Daniël Paulusma 2 1 Department of Applied Mathematics, University of Twente, The Netherlands w.kern@twente.nl 2 Department of Computer Science,
More informationarxiv: v1 [cs.dm] 29 Oct 2012
arxiv:1210.7684v1 [cs.dm] 29 Oct 2012 Square-Root Finding Problem In Graphs, A Complete Dichotomy Theorem. Babak Farzad 1 and Majid Karimi 2 Department of Mathematics Brock University, St. Catharines,
More informationThis article was published in an Elsevier journal. The attached copy is furnished to the author for non-commercial research and education use, including for instruction at the author s institution, sharing
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 informationMATHEMATICAL ENGINEERING TECHNICAL REPORTS. Boundary cliques, clique trees and perfect sequences of maximal cliques of a chordal graph
MATHEMATICAL ENGINEERING TECHNICAL REPORTS Boundary cliques, clique trees and perfect sequences of maximal cliques of a chordal graph Hisayuki HARA and Akimichi TAKEMURA METR 2006 41 July 2006 DEPARTMENT
More informationOn the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs
Theoretical Computer Science 381 (2007) 57 67 www.elsevier.com/locate/tcs On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs C.M.H. de Figueiredo a,, L.
More informationTree Decomposition of Graphs
Tree Decomposition of Graphs Raphael Yuster Department of Mathematics University of Haifa-ORANIM Tivon 36006, Israel. e-mail: raphy@math.tau.ac.il Abstract Let H be a tree on h 2 vertices. It is shown
More informationNegative results on acyclic improper colorings
Negative results on acyclic improper colorings Pascal Ochem To cite this version: Pascal Ochem. Negative results on acyclic improper colorings. Stefan Felsner. 005 European Conference on Combinatorics,
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 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 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 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 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 informationThe path partition problem and related problems in bipartite graphs
The path partition problem and related problems in bipartite graphs Jérôme Monnot and Sophie Toulouse Abstract We prove that it is NP-complete to decide whether a bipartite graph of maximum degree three
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 informationRelating 2-rainbow domination to weak Roman domination
Relating 2-rainbow domination to weak Roman domination José D. Alvarado 1, Simone Dantas 1, and Dieter Rautenbach 2 arxiv:1507.04901v1 [math.co] 17 Jul 2015 1 Instituto de Matemática e Estatística, Universidade
More informationEdge-maximal graphs of branchwidth k
Electronic Notes in Discrete Mathematics 22 (2005) 363 368 www.elsevier.com/locate/endm Edge-maximal graphs of branchwidth k Christophe Paul 1 CNRS - LIRMM, Montpellier, France Jan Arne Telle 2 Dept. of
More informationDiscrete Mathematics
Discrete Mathematics 310 (2010) 3398 303 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: www.elsevier.com/locate/disc Maximal cliques in {P 2 P 3, C }-free graphs S.A.
More 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 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 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 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 informationFractional coloring and the odd Hadwiger s conjecture
European Journal of Combinatorics 29 (2008) 411 417 www.elsevier.com/locate/ejc Fractional coloring and the odd Hadwiger s conjecture Ken-ichi Kawarabayashi a, Bruce Reed b a National Institute of Informatics,
More informationInduced Subgraph Isomorphism on proper interval and bipartite permutation graphs
Induced Subgraph Isomorphism on proper interval and bipartite permutation graphs Pinar Heggernes Pim van t Hof Daniel Meister Yngve Villanger Abstract Given two graphs G and H as input, the Induced Subgraph
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 informationP versus NP. Math 40210, Spring September 16, Math (Spring 2012) P versus NP September 16, / 9
P versus NP Math 40210, Spring 2012 September 16, 2012 Math 40210 (Spring 2012) P versus NP September 16, 2012 1 / 9 Properties of graphs A property of a graph is anything that can be described without
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution
More informationOn (δ, χ)-bounded families of graphs
On (δ, χ)-bounded families of graphs András Gyárfás Computer and Automation Research Institute Hungarian Academy of Sciences Budapest, P.O. Box 63 Budapest, Hungary, H-1518 gyarfas@sztaki.hu Manouchehr
More 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 informationThe NP-Hardness of the Connected p-median Problem on Bipartite Graphs and Split Graphs
Chiang Mai J. Sci. 2013; 40(1) 8 3 Chiang Mai J. Sci. 2013; 40(1) : 83-88 http://it.science.cmu.ac.th/ejournal/ Contributed Paper The NP-Hardness of the Connected p-median Problem on Bipartite Graphs and
More informationHOW IS A CHORDAL GRAPH LIKE A SUPERSOLVABLE BINARY MATROID?
HOW IS A CHORDAL GRAPH LIKE A SUPERSOLVABLE BINARY MATROID? RAUL CORDOVIL, DAVID FORGE AND SULAMITA KLEIN To the memory of Claude Berge Abstract. Let G be a finite simple graph. From the pioneering work
More informationPartial cubes: structures, characterizations, and constructions
Partial cubes: structures, characterizations, and constructions Sergei Ovchinnikov San Francisco State University, Mathematics Department, 1600 Holloway Ave., San Francisco, CA 94132 Abstract Partial cubes
More informationarxiv: v2 [cs.dm] 17 Nov 2012
The star and biclique coloring and choosability problems Marina Groshaus Francisco J. Soulignac Pablo Terlisky {groshaus,fsoulign,terlisky}@dc.uba.ar arxiv:1210.7269v2 [cs.dm] 17 Nov 2012 Abstract A biclique
More informationMinimum Cost Homomorphisms to Semicomplete Multipartite Digraphs
Minimum Cost Homomorphisms to Semicomplete Multipartite Digraphs Gregory Gutin Arash Rafiey Anders Yeo Abstract For digraphs D and H, a mapping f : V (D) V (H) is a homomorphism of D to H if uv A(D) implies
More informationOn Graph Contractions and Induced Minors
On Graph Contractions and Induced Minors Pim van t Hof, 1, Marcin Kamiński 2, Daniël Paulusma 1,, Stefan Szeider, 3, and Dimitrios M. Thilikos 4, 1 School of Engineering and Computing Sciences, Durham
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 informationAdvanced Topics in Discrete Math: Graph Theory Fall 2010
21-801 Advanced Topics in Discrete Math: Graph Theory Fall 2010 Prof. Andrzej Dudek notes by Brendan Sullivan October 18, 2010 Contents 0 Introduction 1 1 Matchings 1 1.1 Matchings in Bipartite Graphs...................................
More informationFlavia Bonomo, Guillermo Duran, Amedeo Napoli, Mario Valencia-Pabon. HAL Id: hal
A one-to-one correspondence between potential solutions of the cluster deletion problem and the minimum sum coloring problem, and its application to P4 -sparse graphs Flavia Bonomo, Guillermo Duran, Amedeo
More informationClassical Complexity and Fixed-Parameter Tractability of Simultaneous Consecutive Ones Submatrix & Editing Problems
Classical Complexity and Fixed-Parameter Tractability of Simultaneous Consecutive Ones Submatrix & Editing Problems Rani M. R, Mohith Jagalmohanan, R. Subashini Binary matrices having simultaneous consecutive
More informationThe minimum G c cut problem
The minimum G c cut problem Abstract In this paper we define and study the G c -cut problem. Given a complete undirected graph G = (V ; E) with V = n, edge weighted by w(v i, v j ) 0 and an undirected
More informationb-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs
b-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs Flavia Bonomo 1, Oliver Schaudt 2, Maya Stein 3, and Mario Valencia-Pabon 4 1 CONICET and Dep. de Computación, Facultad
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 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 informationKernelization by matroids: Odd Cycle Transversal
Lecture 8 (10.05.2013) Scribe: Tomasz Kociumaka Lecturer: Marek Cygan Kernelization by matroids: Odd Cycle Transversal 1 Introduction The main aim of this lecture is to give a polynomial kernel for the
More informationMore on NP and Reductions
Indian Institute of Information Technology Design and Manufacturing, Kancheepuram Chennai 600 127, India An Autonomous Institute under MHRD, Govt of India http://www.iiitdm.ac.in COM 501 Advanced Data
More informationThe 3-colored Ramsey number of odd cycles
Electronic Notes in Discrete Mathematics 19 (2005) 397 402 www.elsevier.com/locate/endm The 3-colored Ramsey number of odd cycles Yoshiharu Kohayakawa a,1,4 a Instituto de Matemática e Estatística, Universidade
More informationLecture 1 : Probabilistic Method
IITM-CS6845: Theory Jan 04, 01 Lecturer: N.S.Narayanaswamy Lecture 1 : Probabilistic Method Scribe: R.Krithika The probabilistic method is a technique to deal with combinatorial problems by introducing
More informationCluster Graph Modification Problems
Cluster Graph Modification Problems Ron Shamir Roded Sharan Dekel Tsur December 2002 Abstract In a clustering problem one has to partition a set of elements into homogeneous and well-separated subsets.
More informationThe Complexity of Maximum. Matroid-Greedoid Intersection and. Weighted Greedoid Maximization
Department of Computer Science Series of Publications C Report C-2004-2 The Complexity of Maximum Matroid-Greedoid Intersection and Weighted Greedoid Maximization Taneli Mielikäinen Esko Ukkonen University
More informationHong-Gwa Yeh and Gerard J. Chang. 1. Introduction
TAIWANESE JOURNAL OF MATHEMATICS Vol. 2, No. 3, pp. 353-360, September 1998 THE PATH-PARTITION PROBLEM IN BIPARTITE DISTANCE-HEREDITARY GRAPHS Hong-Gwa Yeh and Gerard J. Chang Abstract. A path partition
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 informationDurham Research Online
Durham Research Online Deposited in DRO: 30 November 2016 Version of attached le: Accepted Version Peer-review status of attached le: Peer-reviewed Citation for published item: Alves, Sancrey Rodrigues
More information1.1 P, NP, and NP-complete
CSC5160: Combinatorial Optimization and Approximation Algorithms Topic: Introduction to NP-complete Problems Date: 11/01/2008 Lecturer: Lap Chi Lau Scribe: Jerry Jilin Le This lecture gives a general introduction
More informationThe restrictive H-coloring problem
Discrete Applied Mathematics 145 (2005) 297 305 www.elsevier.com/locate/dam The restrictive H-coloring problem Josep Díaz 1, Maria Serna 2, Dimitrios M. Thilikos 2 Departament de Llenguatges i Sistemes
More informationGeneralizations of Matched CNF Formulas
Generalizations of Matched CNF Formulas Stefan Szeider (szeider@cs.toronto.edu) Department of Computer Science, University of Toronto, M5S 3G4 Toronto, Ontario, Canada Abstract. A CNF formula is called
More informationMulti-coloring and Mycielski s construction
Multi-coloring and Mycielski s construction Tim Meagher Fall 2010 Abstract We consider a number of related results taken from two papers one by W. Lin [1], and the other D. C. Fisher[2]. These articles
More informationarxiv: v1 [cs.dm] 26 Apr 2010
A Simple Polynomial Algorithm for the Longest Path Problem on Cocomparability Graphs George B. Mertzios Derek G. Corneil arxiv:1004.4560v1 [cs.dm] 26 Apr 2010 Abstract Given a graph G, the longest path
More informationParameterizing cut sets in a graph by the number of their components
Parameterizing cut sets in a graph by the number of their components Takehiro Ito 1, Marcin Kamiński 2, Daniël Paulusma 3, and Dimitrios M. Thilikos 4 1 Graduate School of Information Sciences, Tohoku
More informationChoosability on H-Free Graphs
Choosability on H-Free Graphs Petr A. Golovach 1, Pinar Heggernes 1, Pim van t Hof 1, and Daniël Paulusma 2 1 Department of Informatics, University of Bergen, Norway {petr.golovach,pinar.heggernes,pim.vanthof}@ii.uib.no
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 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 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 informationDynamic Programming on Trees. Example: Independent Set on T = (V, E) rooted at r V.
Dynamic Programming on Trees Example: Independent Set on T = (V, E) rooted at r V. For v V let T v denote the subtree rooted at v. Let f + (v) be the size of a maximum independent set for T v that contains
More informationOn a Conjecture Concerning Helly Circle Graphs
On a Conjecture Concerning Helly Circle Graphs Guillermo Durán 1 Agustín Gravano 2 Marina Groshaus 3 Fábio Protti 4 Jayme L. Szwarcfiter 5 Abstract We say that G is an e-circle graph if there is a bijection
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 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 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 information