1. Linear time algorithm for computing a small biclique in graphs without long induced paths;Atminas,2012
2. A linear-time algorithm for finding tree-decompositions of small treewidth;Bodlaender;SIAM J. Comput.,1996
3. Graph Theory;Bondy,2008
4. Triangle-free graphs and forbidden subgraphs;Brandt;Discrete Appl. Math.,2002
5. P6- and triangle-free graphs revisited: structure and bounded clique-width;Brandstädt;Discrete Math. Theor. Comput. Sci.,2006