Exploring pairwise compatibility graphs

DOI10.1016/j.tcs.2012.11.015zbMath1258.05104OpenAlexW1971001158MaRDI QIDQ1935784

Tiziana Calamoneri, Rossella Petreschi, Blerina Sinaimeri, Eugenio Montefusco

Publication date: 19 February 2013

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

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

zbMATH Keywords

threshold graphstwinsPCGgraph complementdisjoint union of graphsleaf power graphs

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items

On pairwise compatibility graphs having Dilworth number two ⋮ Pairwise Compatibility Graphs: A Survey ⋮ Towards a characterization of leaf powers by clique arrangements ⋮ New results on pairwise compatibility graphs ⋮ Exact-2-relation graphs ⋮ Corrigendum to: ``On pairwise compatibility graphs having Dilworth number two ⋮ A method for enumerating pairwise compatibility graphs with a given number of vertices ⋮ Inferring phylogenetic trees from the knowledge of rare evolutionary events ⋮ On pairwise compatibility graphs having Dilworth number \(k\) ⋮ A Necessary Condition and a Sufficient Condition for Pairwise Compatibility Graphs ⋮ On the enumeration of minimal non-pairwise compatibility graphs ⋮ On the enumeration of minimal non-pairwise compatibility graphs ⋮ ON THE PAIRWISE COMPATIBILITY PROPERTY OF SOME SUPERCLASSES OF THRESHOLD GRAPHS ⋮ Some reduction operations to pairwise compatibility graphs ⋮ A survey on pairwise compatibility graphs