The following publications are possibly variants of this publication:
- On pairwise compatibility graphs having Dilworth number kTiziana Calamoneri, Rossella Petreschi. TCS, 547:82-89, 2014. [doi]
- Graphs with Dilworth Number Two are Pairwise Compatibility GraphsTiziana Calamoneri, Rossella Petreschi. endm, 44:31-38, 2013. [doi]
- On pairwise compatibility graphs having Dilworth number twoTiziana Calamoneri, Rossella Petreschi. TCS, 524:34-40, 2014. [doi]
- Corrigendum to "On pairwise compatibility graphs having Dilworth number two" [Theoret. Comput. Science (2014) 34-40]Tiziana Calamoneri, Rossella Petreschi. TCS, 602:524, 2015. [doi]
- Pairwise Compatibility Graphs of CaterpillarsTiziana Calamoneri, Antonio Frangioni, Blerina Sinaimeri. cj, 57(11):1616-1623, 2014. [doi]
- Exploring pairwise compatibility graphsTiziana Calamoneri, Eugenio Montefusco, Rossella Petreschi, Blerina Sinaimeri. TCS, 468:23-36, 2013. [doi]
- Pairwise Compatibility Graphs: A SurveyTiziana Calamoneri, Blerina Sinaimeri. siamrev, 58(3):445-460, 2016. [doi]