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

DOI10.1016/J.TCS.2015.08.020zbMATH Open1330.05086OpenAlexW2215280376MaRDI QIDQ497693FDOQ497693

Authors: 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

Recommendations

• On pairwise compatibility graphs having Dilworth number \(k\)
• On Dilworth \(k\) graphs and their pairwise compatibility
• On pairwise compatibility graphs having Dilworth number two
• Corrigendum to: ``LDFS-based certifying algorithm for the minimum path cover problem on cocomparability graphs
• Corrigendum to ``Graphs and digraphs with all 2-factors isomorphic [J. Combin. Theory Ser. B 92 (2) (2004) 395-404]

Mathematics Subject Classification ID

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

Cites Work

• Exploring pairwise compatibility graphs
• On dynamic threshold graphs and related classes
• On pairwise compatibility graphs having Dilworth number two
• On relaxing the constraints in pairwise compatibility graphs
• Threshold characterization of graphs with dilworth number two

Cited In (4)

• Corrigendum to: ``LDFS-based certifying algorithm for the minimum path cover problem on cocomparability graphs
• Corrigendum to: ``Existence of a perfect matching in a random \((1+e^{-1})\)-out bipartite graph
• Corrigendum to: ``Syndetically proximal pairs
• Corrigendum to ``Almost self-complementary factors of complete bipartite graphs. [Discrete Math. 167/168 (1997), 317-327]

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q497693)