Corrigendum to: ``On pairwise compatibility graphs having Dilworth number two

DOI10.1016/j.tcs.2015.08.020zbMath1330.05086OpenAlexW2215280376MaRDI QIDQ497693

Tiziana Calamoneri, Rossella Petreschi

Publication date: 25 September 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.08.020

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Distance in graphs (05C12) Vertex degrees (05C07)

Cites Work

• On dynamic threshold graphs and related classes
• Exploring pairwise compatibility graphs
• On pairwise compatibility graphs having Dilworth number two
• On Relaxing the Constraints in Pairwise Compatibility Graphs
• Threshold characterization of graphs with dilworth number two

This page was built for publication: Corrigendum to: ``On pairwise compatibility graphs having Dilworth number two