论文信息 - Corrigendum to "On pairwise compatibility graphs having Dilworth number two" [Theoret. Comput. Science (2014) 34-40]

Corrigendum to "On pairwise compatibility graphs having Dilworth number two" [Theoret. Comput. Science (2014) 34-40]

In 4 we put in relation graphs with Dilworth number at most two and the two classes LPG and mLPG. In order to prove this relation, we have heavily exploited a result we deduced from 1. We have now realized that this result is not always true, so in this corrigendum we correctly restate the result concerning the relation between graphs with Dilworth number at most two and the two classes of LPG and mLPG.

Rossella Petreschi | Tiziana Calamoneri

[1] Rossella Petreschi,et al. On Relaxing the Constraints in Pairwise Compatibility Graphs , 2012, WALCOM.

[2] Peter L. Hammer,et al. Threshold characterization of graphs with dilworth number two , 1985, J. Graph Theory.

[3] Rossella Petreschi,et al. Dynamically Operating on Threshold Graphs and Related Classes (Extended Abstract) , 2015, CTW.

[4] Rossella Petreschi,et al. On pairwise compatibility graphs having Dilworth number two , 2014, Theor. Comput. Sci..

[5] Rossella Petreschi,et al. Exploring pairwise compatibility graphs , 2013, Theor. Comput. Sci..