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.

Corrigendum to “On Pairwise Compatibility Graphs having Dilworth Number Two” / Calamoneri, T.; Petreschi, R.. - In: THEORETICAL COMPUTER SCIENCE. - ISSN 0304-3975. - 602:(2015), pp. 158-159. [10.1016/j.tcs.2015.08.020]

Corrigendum to “On Pairwise Compatibility Graphs having Dilworth Number Two”

T. Calamoneri;R. Petreschi
2015

Abstract

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.
2015
Pairwise Compatibility Graphs, Dilworth number
01 Pubblicazione su rivista::01a Articolo in rivista
Corrigendum to “On Pairwise Compatibility Graphs having Dilworth Number Two” / Calamoneri, T.; Petreschi, R.. - In: THEORETICAL COMPUTER SCIENCE. - ISSN 0304-3975. - 602:(2015), pp. 158-159. [10.1016/j.tcs.2015.08.020]
File allegati a questo prodotto
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11573/1474716
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 1
  • ???jsp.display-item.citation.isi??? 1
social impact