A new characterization of P6-free graphs

We study P6P6-free graphs, i.e., graphs that do not contain an induced path on six vertices. Our main result is a new characterization of this graph class: a graph GG is P6P6-free if and only if each connected induced subgraph of GG on more than one vertex contains a dominating induced cycle on six vertices or a dominating (not necessarily induced) complete bipartite subgraph. This characterization is minimal in the sense that there exists an infinite family of P6P6-free graphs for which a smallest connected dominating subgraph is a (not induced) complete bipartite graph. Our characterization of P6P6-free graphs strengthens results of Liu and Zhou, and of Liu, Peng and Zhao. Our proof has the extra advantage of being constructive: we present an algorithm that finds such a dominating subgraph of a connected P6P6-free graph in polynomial time. This enables us to solve the Hypergraph 2-Colorability problem in polynomial time for the class of hypergraphs with P6P6-free incidence graphs.

[1]  E. S. Wolk.  The comparability graph of a tree , 1962 .

[2]  Gerhard J. Woeginger,et al.  The complexity of coloring graphs without long induced paths , 2001, Acta Cybern..

[3]  Z. Tuza,et al.  Dominating cliques in P5-free graphs , 1990 .

[4]  Reinhard Diestel,et al.  Graph Theory , 1997 .

[5]  Ingo Schiermeyer,et al.  3-Colorability in P for P6-free graphs , 2004, Discret. Appl. Math..

[6]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[7]  Yuejian Peng,et al.  Characterization of P6-free graphs , 2007, Discret. Appl. Math..

[8]  Michel Habib,et al.  A simple linear time algorithm for cograph recognition , 2005, Discret. Appl. Math..

[9]  Vassilis Giakoumakis,et al.  Linear Time Recognition and Optimizations for Weak-Bisplit Graphs, Bi-Cographs and Bipartite P6-Free Graphs , 2003, Int. J. Found. Comput. Sci..

[10]  Vadim V. Lozin,et al.  Deciding k-Colorability of P5-Free Graphs in Polynomial Time , 2007, Algorithmica.

[11]  Margaret B. Cozzens,et al.  Dominating cliques in graphs , 1991, Discret. Math..

[12]  Zsolt Tuza,et al.  Dominating Bipartite Subgraphs in Graphs , 2005, Discuss. Math. Graph Theory.

[13]  E. S. Wolk.  A note on “The comparability graph of a tree” , 1965 .

[14]  Lorna Stewart,et al.  A Linear Recognition Algorithm for Cographs , 1985, SIAM J. Comput..

[15]  Joost Engelfriet,et al.  Clique-Width for 4-Vertex Forbidden Subgraphs , 2006, Theory of Computing Systems.

[16]  Jiping Liu,et al.  Dominating subgraphs in graphs with some forbidden structures , 1994, Discret. Math..

[17]  Andreas Brandstädt,et al.  P6- and triangle-free graphs revisited: structure and bounded clique-width , 2006, Discret. Math. Theor. Comput. Sci..