Exploring pairwise compatibility graphs

A. Brandstädt, On leaf powers, Technical report, University of Rostock, 2010.

Brandstädt, 2006, Structure and linear time recognition of 3-leaf powers, Inform. Process. Lett., 98, 133, 10.1016/j.ipl.2006.01.004

Brandstädt, 1999, Graph classes: a survey, SIAM Monographs on Discrete Math. Appl.

Brandstädt, 2008, Structure and linear time recognition of 4-leaf powers, ACM Trans. Algorithms, 5, 11:1, 10.1145/1435375.1435386

Brandstädt, 2010, Rooted directed path graphs are leaf powers, Discrete Math., 310, 897, 10.1016/j.disc.2009.10.006

T. Calamoneri, D. Frascaria, B. Sinaimeri, All graphs with at most seven vertices are Pairwise Compatibility Graphs, Computer J. (2012) (in press). http://dx.doi.org/10.1093/comjnl/bxs087.

T. Calamoneri, R. Petreschi, Graphs with dilworth number 2 are pairwise compatibility (submitted for publication).

Calamoneri, 2012, On relaxing the constraints in pairwise compatibility graphs, vol. 7157, 124

Fellows, 2008, Leaf powers and their properties: using the trees, vol. 5369, 402

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

Garey, 1979

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

Kennedy, 2006, Strictly chordal graphs are leaf powers, J. Discrete Algorithms, 4, 511, 10.1016/j.jda.2005.06.005

Nishimura, 2002, On graph powers for leaf-labeled trees, J. Algorithms, 42, 69, 10.1006/jagm.2001.1195

D. Phillips, Uniform sampling from phylogenetics trees, Masters Thesis, University of Waterloo, 2002.

S.A. Salma, Md.S. Rahman, Ladder graphs are pairwise compatibility graphs, Abstract at Asian Association for Algorithms and Computation (AAAC) (2011) Hsinchu, Taiwan.

Yanhaona, 2010, Discovering Pairwise compatibility graphs, Discrete Math. Algorithms Appl. (DMAA), 2, 607, 10.1142/S1793830910000917

Yanhaona, 2009, Pairwise compatibility graphs, J. Appl. Math. Comput., 30, 479, 10.1007/s12190-008-0204-7