Classifying the clique-width of H-free bipartite graphs
Discrete Applied Mathematics
2016) 'Classifying the clique-width of H-free bipartite graphs.', Discrete applied mathematics., 200 . pp. 43-51. Further information on publisher's website: http://dx.Additional information: Use policy The full-text may be used and/or reproduced, and given to third parties in any format or medium, without prior permission or charge, for personal research or study, educational, or not-for-prot purposes provided that: • a full bibliographic reference is made to the original source • a link is
... e to the metadata record in DRO • the full-text is not changed in any way The full-text must not be sold in any format or medium without the formal permission of the copyright holders. Please consult the full DRO policy for further details. Abstract. Let G be a bipartite graph, and let H be a bipartite graph with a fixed bipartition (BH , WH ). We consider three different, natural ways of forbidding H as an induced subgraph in G. We refer to the surveys of Gurski  and Kamiński, Lozin and Milanič  for an in-depth study of the properties of clique-width. We say that a class of graphs has bounded clique-width if every graph from the class has clique-width at most c for some constant c. As many NP-hard graph problems can be solved in polynomial time on graph classes of bounded cliquewidth [13, 22, 27, 28] , it is natural to determine whether a certain graph class has An extended abstract of this paper appeared in the proceedings of CO-COON 2014 . Our research was supported by EPSRC (EP/G043434/1 and EP/K025090/1) and ANR (TODO ANR-09-EMER-010). We thank the two anonymous referees for their suggestions about the presentation of the paper.