暂无分享,去创建一个
[1] Sang-il Oum,et al. Approximating rank-width and clique-width quickly , 2008, ACM Trans. Algorithms.
[2] Konrad Dabrowski,et al. Colouring of graphs with Ramsey-type forbidden subgraphs , 2013, Theor. Comput. Sci..
[3] Joost Engelfriet,et al. Clique-Width for 4-Vertex Forbidden Subgraphs , 2006, Theory of Computing Systems.
[4] Michaël Rao,et al. MSOL partitioning problems on graphs of bounded treewidth and clique-width , 2007, Theor. Comput. Sci..
[5] Johann A. Makowsky,et al. On the Clique-Width of Graphs with Few P4's , 1999, Int. J. Found. Comput. Sci..
[6] Konrad Dabrowski,et al. Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs , 2014, Comput. J..
[7] Konrad Dabrowski,et al. Classifying the Clique-Width of H-Free Bipartite Graphs , 2014, COCOON.
[8] Vadim V. Lozin,et al. On the linear structure and clique-width of bipartite permutation graphs , 2003, Ars Comb..
[9] Vadim V. Lozin,et al. Recent developments on graphs of bounded clique-width , 2009, Discret. Appl. Math..
[10] Pinar Heggernes,et al. Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs , 2012, Discret. Appl. Math..
[11] Dieter Rautenbach,et al. On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex Degree , 2004, SIAM J. Discret. Math..
[12] Konrad Dabrowski,et al. Bounding the clique-width of H-free split graphs , 2015, Discret. Appl. Math..
[13] Martin Milanic,et al. Graph classes with and without powers of bounded clique-width , 2014, Discret. Appl. Math..
[14] Konrad Dabrowski,et al. Bounding Clique-Width via Perfect Graphs , 2014, LATA.
[15] Vadim V. Lozin,et al. The Clique-Width of Bipartite Graphs in Monogenic Classes , 2008, Int. J. Found. Comput. Sci..
[16] Bruno Courcelle,et al. Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width , 2000, Theory of Computing Systems.
[17] Andreas Brandstädt,et al. Gem- And Co-Gem-Free Graphs Have Bounded Clique-Width , 2004, Int. J. Found. Comput. Sci..
[18] Andreas Brandstädt,et al. Chordal co-gem-free and (P5, gem)-free graphs have bounded clique-width , 2005, Discret. Appl. Math..
[19] Andreas Brandstädt,et al. On variations of P4-sparse graphs , 2003, Discret. Appl. Math..
[20] Andreas Brandstädt,et al. Maximum Weight Stable Set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time , 2002, Inf. Process. Lett..
[21] Andreas Brandstädt,et al. P6- and triangle-free graphs revisited: structure and bounded clique-width , 2006, Discret. Math. Theor. Comput. Sci..
[22] Konrad Dabrowski,et al. Bounding the Clique‐Width of H‐Free Chordal Graphs , 2015, J. Graph Theory.
[23] Dieter Kratsch,et al. On the structure of (P5, gem)-free graphs , 2005, Discret. Appl. Math..
[24] Bruno Courcelle,et al. Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width , 1998, WG.
[25] Bruno Courcelle,et al. Upper bounds to the clique width of graphs , 2000, Discret. Appl. Math..
[26] Vadim V. Lozin,et al. On the Clique-Width of Graphs in Hereditary Classes , 2002, ISAAC.
[27] Udi Rotics,et al. Edge dominating set and colorings on graphs with fixed clique-width , 2003, Discret. Appl. Math..
[28] Daniël Paulusma,et al. Bounding the Clique-Width of H-Free Chordal Graphs , 2017, J. Graph Theory.
[29] Dieter Rautenbach,et al. The tree- and clique-width of bipartite graphs in special classes , 2006, Australas. J Comb..
[30] Konrad Dabrowski,et al. Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs , 2015, CIAC.