Some classes of graphs that are not PCGs

Omland, 1999, The assumptions and challenges of ancestral state reconstructions, Syst. Biol., 48, 604, 10.1080/106351599260175

Felsenstein, 1978, Cases in which parsimony or compatibility methods will be positively misleading, Syst. Zool., 27, 401, 10.2307/2412923

Kearney, 2003, Efficient generation of uniform samples from phylogenetic trees, vol. 2812, 177

Calamoneri, 2013, All graphs with at most seven vertices are pairwise compatibility graphs, Comput. J., 56, 882, 10.1093/comjnl/bxs087

Yanhaona, 2010, Discovering pairwise compatibility graphs, Discrete Math. Algorithms Appl., 2, 607, 10.1142/S1793830910000917

Mehnaz, 2013, Pairwise compatibility graphs revisited

Durocher, 2015, On graphs that are not PCGs, Theor. Comput. Sci., 571, 78, 10.1016/j.tcs.2015.01.011

Calamoneri, 2016, On pairwise compatibility graphs: a survey, SIAM Rev., 58, 445, 10.1137/140978053

Yanhaona, 2009, Pairwise compatibility graphs, SIAM J. Sci. Comput., 30, 479

Brandstädt, 2008, Ptolemaic graphs and interval graphs are leaf powers, vol. 4957, 479

Salma, 2013, Triangle-free outerplanar 3-graphs are pairwise compatibility graphs, J. Graph Algorithms Appl., 17, 81, 10.7155/jgaa.00286

Calamoneri, 2014, On pairwise compatibility graphs having dilworth number two, Theor. Comput. Sci., 524, 34, 10.1016/j.tcs.2013.12.015

Calamoneri, 2014, On pairwise compatibility graphs having dilworth number k, Theor. Comput. Sci., 547, 82, 10.1016/j.tcs.2014.06.024

Calamoneri, 2014, Pairwise compatibility graphs of caterpillars, Comput. J., 57, 1616, 10.1093/comjnl/bxt068

Hossain, 2017, A necessary condition and a sufficient condition for pairwise compatibility graphs, J. Graph Algorithms Appl., 21, 341, 10.7155/jgaa.00419

Brandstädt, 2010