Exploring pairwise compatibility graphs

DOI10.1016/J.TCS.2012.11.015zbMATH Open1258.05104OpenAlexW1971001158MaRDI QIDQ1935784FDOQ1935784

Authors: Tiziana Calamoneri, Rossella Petreschi, Eugenio Montefusco, Blerina Sinaimeri 

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

Recommendations

• On relaxing the constraints in pairwise compatibility graphs
• Pairwise compatibility graphs: a survey
• Pairwise compatibility graphs
• Pairwise Compatibility Graphs
• Some reduction operations to pairwise compatibility graphs

zbMATH Keywords

twinsthreshold graphsPCGgraph complementdisjoint union of graphsleaf power graphs

Mathematics Subject Classification ID

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

Cited In (24)

• On pairwise compatibility graphs having Dilworth number \(k\)
• A method for enumerating pairwise compatibility graphs with a given number of vertices
• On relaxing the constraints in pairwise compatibility graphs
• Some classes of graphs that are not PCGs
• Some reduction operations to pairwise compatibility graphs
• A survey on pairwise compatibility graphs
• Title not available (Why is that?)
• On pairwise compatibility graphs having Dilworth number two
• Inferring phylogenetic trees from the knowledge of rare evolutionary events
• Pairwise compatibility graphs: a survey
• Pairwise Compatibility Graphs
• New results on pairwise compatibility graphs
• On Dilworth \(k\) graphs and their pairwise compatibility
• Triangle-free outerplanar 3-graphs are pairwise compatibility graphs
• A Necessary Condition and a Sufficient Condition for Pairwise Compatibility Graphs
• Graphs that are not pairwise compatible: a new proof technique (extended abstract)
• Pairwise compatibility graphs
• Exact-2-relation graphs
• Towards a characterization of leaf powers by clique arrangements
• On the pairwise compatibility property of some superclasses of threshold graphs
• Corrigendum to: ``On pairwise compatibility graphs having Dilworth number two
• DISCOVERING PAIRWISE COMPATIBILITY GRAPHS
• On the enumeration of minimal non-pairwise compatibility graphs
• On the enumeration of minimal non-pairwise compatibility graphs

This page was built for publication: Exploring pairwise compatibility graphs

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