On stable cutsets in claw-free graphs and planar graphs

A stable cutset in a connected graph is a stable set whose deletion disconnects the graph. Let K"4 and K"1","3 (claw) denote the complete (bipartite) graph on 4 and 1+3 vertices. It is NP-complete to decide whether a line graph (hence a claw-free graph) with maximum degree five or a K"4-free graph admits a stable cutset. Here we describe algorithms deciding in polynomial time whether a claw-free graph with maximum degree at most four or whether a (claw, K"4)-free graph admits a stable cutset. As a by-product we obtain that the stable cutset problem is polynomially solvable for claw-free planar graphs, and also for planar line graphs. Thus, the computational complexity of the stable cutset problem is completely determined for claw-free graphs with respect to degree constraint, and for claw-free planar graphs. Moreover, we prove that the stable cutset problem remains NP-complete for K"4-free planar graphs with maximum degree five.

[1]  David Lichtenstein,et al.  Planar Formulae and Their Uses , 1982, SIAM J. Comput..

[2]  Andreas Brandstädt,et al.  New applications of clique separator decomposition for the Maximum Weight Stable Set problem , 2005, Theor. Comput. Sci..

[3]  Van Bang Le,et al.  On Stable Cutsets in Line Graphs , 2001, WG.

[4]  Ronald L. Graham,et al.  ON PRIMITIVE GRAPHS AND OPTIMAL VERTEX ASSIGNMENTS , 1970 .

[5]  Jan Kratochvíl.  A Special Planar Satisfiability Problem and a Consequence of Its NP-completeness , 1994, Discret. Appl. Math..

[6]  Vasek Chvátal,et al.  Recognizing decomposable graphs , 1984, J. Graph Theory.

[7]  Fanica Gavril,et al.  Algorithms on clique separable graphs , 1977, Discret. Math..

[8]  Paul S. Bonsma,et al.  The complexity of the matching‐cut problem for planar graphs and other graph classes , 2003, J. Graph Theory.

[9]  Arthur M. Farley,et al.  Networks immune to isolated line failures , 1982, Networks.

[10]  Philippe G. H. Lehot.  An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph , 1974, JACM.

[11]  Robert E. Tarjan,et al.  Decomposition by clique separators , 1985, Discret. Math..

[12]  Jean Fonlupt,et al.  Stable Set Bonding in Perfect Graphs and Parity Graphs , 1993, J. Comb. Theory, Ser. B.

[13]  Nick Roussopoulos,et al.  A MAX{m, n} Algorithm for Determining the Graph H from Its Line Graph C , 1973, Inf. Process. Lett..

[14]  C. Figueiredo,et al.  The NP-completeness of multi-partite cutset testing , 1996 .

[15]  Maurizio Patrignani,et al.  The Complexity of the Matching-Cut Problem , 2001, WG.

[16]  Feodor F. Dragan,et al.  On stable cutsets in graphs , 2000, Discret. Appl. Math..

[17]  Alan Tucker.  Coloring graphs with stable cutsets , 1983, J. Comb. Theory, Ser. B.

[18]  Augustine M. Moshi.  Matching cutsets in graphs , 1989, J. Graph Theory.

[19]  Sue Whitesides,et al.  An Algorithm for Finding Clique Cut-Sets , 1981, Inf. Process. Lett..

[20]  Daniele Degiorgi.  A new linear algorithm to detect a line graph and output its root graph , 1990 .

[21]  Robert E. Tarjan,et al.  Rectilinear planar layouts and bipolar orientations of planar graphs , 1986, Discret. Comput. Geom..

[22]  Michael S. Jacobson,et al.  Fragile graphs with small independent cuts , 2002, J. Graph Theory.

[23]  S. Whitesides.  A Method for Solving Certain Graph Recognition and Optimization Problems, with Applications to Perfect Graphs , 1982 .

[24]  Xingxing Yu,et al.  A note on fragile graphs , 2002, Discret. Math..

[25]  Sulamita Klein,et al.  List Partitions , 2003, SIAM J. Discret. Math..

[26]  L. Beineke,et al.  Selected Topics in Graph Theory 2 , 1985 .