1. N.A. Azam, M. Ito, A. Shurbevski, H. Nagamochi, Enumerating all pairwise compatibility graphs with a given number of vertices based on linear programming, in: Proceedings of 2nd International Workshop on Enumeration Problems and Applications, WEPA, Pisa, Italy, 5–8 2018, WEPA2018 6c.
2. Some classes of graphs that are not PCGs;Baiocchi;Theoret. Comput. Sci.,2019
3. Pairwise compatibility graphs of caterpillars;Calamoneri;Comput. J.,2014
4. All graphs with at most seven vertices are pairwise compatibility graphs;Calamoneri;Comput. J.,2013
5. Pairwise compatibility graphs: A survey;Calamoneri;SIAM Rev.,2016