On Relaxing the Constraints in Pairwise Compatibility Graphs

DOI10.1007/978-3-642-28076-4_14zbMath1351.05190arXiv1105.2171OpenAlexW1962996173MaRDI QIDQ2889906

Rossella Petreschi, Blerina Sinaimeri, Tiziana Calamoneri

Publication date: 8 June 2012

Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1105.2171

zbMATH Keywords

threshold graphsPCGmatrogenic graphsleaf power graph

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Distance in graphs (05C12) Signed and weighted graphs (05C22)

Related Items (7)

On pairwise compatibility graphs having Dilworth number two ⋮ Pairwise Compatibility Graphs: A Survey ⋮ Multi-interval Pairwise Compatibility Graphs ⋮ Corrigendum to: ``On pairwise compatibility graphs having Dilworth number two ⋮ On graphs that are not PCGs ⋮ A Necessary Condition and a Sufficient Condition for Pairwise Compatibility Graphs ⋮ A survey on pairwise compatibility graphs

This page was built for publication: On Relaxing the Constraints in Pairwise Compatibility Graphs