Classifying the Clique-Width of H-Free Bipartite Graphs
暂无分享,去创建一个
[1] Joost Engelfriet,et al. Clique-Width for 4-Vertex Forbidden Subgraphs , 2006, Theory of Computing Systems.
[2] Vadim V. Lozin,et al. The Clique-Width of Bipartite Graphs in Monogenic Classes , 2008, Int. J. Found. Comput. Sci..
[3] Dieter Kratsch,et al. On the structure of (P5, gem)-free graphs , 2005, Discret. Appl. Math..
[4] Johann A. Makowsky,et al. On the Clique-Width of Graphs with Few P4's , 1999, Int. J. Found. Comput. Sci..
[5] Konrad Dabrowski,et al. Colouring of graphs with Ramsey-type forbidden subgraphs , 2014, Theor. Comput. Sci..
[6] Vadim V. Lozin,et al. Recent developments on graphs of bounded clique-width , 2009, Discret. Appl. Math..
[7] Sang-il Oum,et al. Approximating rank-width and clique-width quickly , 2008, ACM Trans. Algorithms.
[8] Michaël Rao,et al. MSOL partitioning problems on graphs of bounded treewidth and clique-width , 2007, Theor. Comput. Sci..
[9] Udi Rotics,et al. Edge dominating set and colorings on graphs with fixed clique-width , 2003, Discret. Appl. Math..
[10] Andreas Brandstädt,et al. P6- and triangle-free graphs revisited: structure and bounded clique-width , 2006, Discret. Math. Theor. Comput. Sci..
[11] Vadim V. Lozin,et al. On the Clique-Width of Graphs in Hereditary Classes , 2002, ISAAC.
[12] Dieter Rautenbach,et al. The tree- and clique-width of bipartite graphs in special classes , 2006, Australas. J Comb..
[13] Konrad Dabrowski,et al. Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs , 2015, CIAC.
[14] Bruno Courcelle,et al. Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width , 2000, Theory of Computing Systems.
[15] Andreas Brandstädt,et al. Gem- And Co-Gem-Free Graphs Have Bounded Clique-Width , 2004, Int. J. Found. Comput. Sci..
[16] Andreas Brandstädt,et al. Chordal co-gem-free and (P5, gem)-free graphs have bounded clique-width , 2005, Discret. Appl. Math..
[17] Andreas Brandstädt,et al. On variations of P4-sparse graphs , 2003, Discret. Appl. Math..
[18] 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..
[19] Dieter Rautenbach,et al. On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex Degree , 2004, SIAM J. Discret. Math..