Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference20 articles.
1. On rank-width of even-hole-free graphs;Adler;Discret. Math. Theor. Comput. Sci.,2017
2. Graph isomorphism for (H1,H2)-free graphs: an almost complete dichotomy;Bonamy;Algorithmica,2021
3. Bounding the clique-width of H-free split graphs;Brandstädt;Discrete Appl. Math.,2016
4. Bounding the clique-width of H-free chordal graphs;Brandstädt;J. Graph Theory,2017
5. On the structure of (pan, even hole)-free graphs;Cameron;J. Graph Theory,2018