Perfect coloring and linearly χ-bound P 6 -free graphs
暂无分享,去创建一个
[1] Sheshayya A. Choudum,et al. The class of {3K 1 , C 4 }-free graphs. , 2005 .
[2] Andreas Brandstädt,et al. On the structure and stability number of P5- and co-chair-free graphs , 2003, Discret. Appl. Math..
[3] Raffaele Mosca,et al. On (P5, diamond)-free graphs , 2002, Discret. Math..
[4] N Ontario,et al. P 4 -Free Colorings and P 4 -Bipartite Graphs , 2001 .
[5] Zsolt Tuza,et al. A characterization of graphs without long induced paths , 1990, J. Graph Theory.
[6] P. Seymour,et al. The Strong Perfect Graph Theorem , 2002, math/0212070.
[7] Frederic Maire,et al. On graphs without P5 and P5_ , 1995, Discret. Math..
[8] Raffaele Mosca. Some results on maximum stable sets in certain P5-free graphs , 2003, Discret. Appl. Math..
[9] A. Gyárfás. Problems from the world surrounding perfect graphs , 1987 .
[10] D. West. Introduction to Graph Theory , 1995 .
[11] Dieter Kratsch,et al. On the structure of (P5, gem)-free graphs , 2005, Discret. Appl. Math..
[12] Bruno Courcelle,et al. Upper bounds to the clique width of graphs , 2000, Discret. Appl. Math..
[13] Z. Tuza,et al. Dominating cliques in P5-free graphs , 1990 .
[14] Andreas Brandstädt,et al. (P5, diamond)-free graphs revisited: structure and linear time optimization , 2004, Discret. Appl. Math..