Baiocchi, Pierluigi; Calamoneri, Tiziana; Monti, Angelo; Petreschi, Rossella Some classes of graphs that are not PCGs. (English) Zbl 1433.05307 Theor. Comput. Sci. 791, 62-75 (2019). MSC: 05C99 05C22 PDFBibTeX XMLCite \textit{P. Baiocchi} et al., Theor. Comput. Sci. 791, 62--75 (2019; Zbl 1433.05307) Full Text: DOI arXiv
Baiocchi, Pierluigi; Calamoneri, Tiziana; Monti, Angelo; Petreschi, Rossella Graphs that are not pairwise compatible: a new proof technique (extended abstract). (English) Zbl 1511.05197 Iliopoulos, Costas (ed.) et al., Combinatorial algorithms. 29th international workshop, IWOCA 2018, Singapore, July 16–19, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10979, 39-51 (2018). MSC: 05C75 05C05 05C10 05C22 92D15 PDFBibTeX XMLCite \textit{P. Baiocchi} et al., Lect. Notes Comput. Sci. 10979, 39--51 (2018; Zbl 1511.05197) Full Text: DOI Link
Calamoneri, Tiziana; Sinaimeri, Blerina Pairwise compatibility graphs: a survey. (English) Zbl 1342.05058 SIAM Rev. 58, No. 3, 445-460 (2016). MSC: 05C22 05C90 68R01 68R10 05-02 PDFBibTeX XMLCite \textit{T. Calamoneri} and \textit{B. Sinaimeri}, SIAM Rev. 58, No. 3, 445--460 (2016; Zbl 1342.05058) Full Text: DOI Link
Calamoneri, Tiziana; Petreschi, Rossella On pairwise compatibility graphs having Dilworth number \(k\). (English) Zbl 1420.05046 Theor. Comput. Sci. 547, 82-89 (2014). MSC: 05C12 PDFBibTeX XMLCite \textit{T. Calamoneri} and \textit{R. Petreschi}, Theor. Comput. Sci. 547, 82--89 (2014; Zbl 1420.05046) Full Text: DOI
Calamoneri, Tiziana; Petreschi, Rossella On Dilworth \(k\) graphs and their pairwise compatibility. (English) Zbl 1407.05071 Pal, Sudebkumar Prasant (ed.) et al., Algorithms and computation. 8th international workshop, WALCOM 2014, Chennai, India, February 13–15, 2014. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 8344, 213-224 (2014). MSC: 05C12 PDFBibTeX XMLCite \textit{T. Calamoneri} and \textit{R. Petreschi}, Lect. Notes Comput. Sci. 8344, 213--224 (2014; Zbl 1407.05071) Full Text: DOI
Calamoneri, T.; Petreschi, R. On pairwise compatibility graphs having Dilworth number two. (English) Zbl 1283.05142 Theor. Comput. Sci. 524, 34-40 (2014); corrigendum ibid. 602, 158-159 (2015). MSC: 05C35 05C05 05C07 05C12 PDFBibTeX XMLCite \textit{T. Calamoneri} and \textit{R. Petreschi}, Theor. Comput. Sci. 524, 34--40 (2014; Zbl 1283.05142) Full Text: DOI