暂无分享,去创建一个
[1] Dieter Kratsch,et al. On the structure of (P5, gem)-free graphs , 2005, Discret. Appl. Math..
[2] Bruno Courcelle,et al. Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width , 1998, WG.
[3] Vassilis Giakoumakis,et al. On P4-tidy graphs , 1997, Discrete Mathematics & Theoretical Computer Science.
[4] Florian Roussel,et al. On Graphs with Limited Number of P4-Partners , 1999, Int. J. Found. Comput. Sci..
[5] Z. Tuza,et al. Dominating cliques in P5-free graphs , 1990 .
[6] Jean-Marie Vanherpe,et al. On bipartite graphs with weak density of some subgraphs , 2007, Discret. Math..
[7] Vassilis Giakoumakis,et al. Weighted Parameters in (P5, P5)-free Graphs , 1997, Discret. Appl. Math..
[8] Dominique de Werra,et al. Four classes of perfectly orderable graphs , 1987, J. Graph Theory.
[9] Jean-Luc Fouquet. A decomposition for a class of (P5, P5_5)-free graphs , 1993, Discret. Math..