Exploring pairwise compatibility graphs

DOI10.1016/J.TCS.2012.11.015MaRDI QIDQ1935784zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

disjoint union of graphsgraph complementleaf power graphsPCGthreshold graphstwins

Mathematics Subject Classification ID

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

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

Cited in

(25)

• Pairwise compatibility graphs
• Graphs that are not pairwise compatible: a new proof technique (extended abstract)
• Inferring phylogenetic trees from the knowledge of rare evolutionary events
• A method for enumerating pairwise compatibility graphs with a given number of vertices
• New results on pairwise compatibility graphs
• Exact-2-relation graphs
• On pairwise compatibility graphs having Dilworth number k
• Some classes of graphs that are not PCGs
• Some reduction operations to pairwise compatibility graphs
• On pairwise compatibility graphs having Dilworth number two
• On the pairwise compatibility property of some superclasses of threshold graphs
• On relaxing the constraints in pairwise compatibility graphs
• DISCOVERING PAIRWISE COMPATIBILITY GRAPHS
• Pairwise compatibility graphs: a survey
• scientific article; zbMATH DE number 1844499 (Why is no real title available?)
• Triangle-free outerplanar 3-graphs are pairwise compatibility graphs
• Corrigendum to: ``On pairwise compatibility graphs having Dilworth number two
• A survey on pairwise compatibility graphs
• Pairwise Compatibility Graphs
• On Dilworth k graphs and their pairwise compatibility
• 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
• All graphs with at most 8 nodes are 2-interval-PCGs
• On generalizations of 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)