DISCOVERING PAIRWISE COMPATIBILITY GRAPHS

DOI10.1142/S1793830910000917zbMATH Open1216.05138MaRDI QIDQ3084693FDOQ3084693

Authors: Muhammad Nur Yanhaona, Md. Shamsuzzoha Bayzid, Md. Saidur Rahman 

Publication date: 25 March 2011

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Recommendations

• Discovering pairwise compatibility graphs
• Exploring pairwise compatibility graphs
• Pairwise Compatibility Graphs
• Pairwise compatibility graphs
• Pairwise compatibility graphs: a survey
• A survey on pairwise compatibility graphs
• New results on pairwise compatibility graphs
• Multi-interval pairwise compatibility graphs (extended abstract)
• On relaxing the constraints in pairwise compatibility graphs
• Compatibility in a graph-theoretic setting

zbMATH Keywords

phylogenetic treepairwise compatibility graphstree powertree root

Mathematics Subject Classification ID

Applications of graph theory (05C90) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• Introduction to algorithms
• The maximum clique problem
• Pairwise compatibility graphs
• Title not available (Why is that?)

Cited In (20)

• On pairwise compatibility graphs having Dilworth number \(k\)
• Some classes of graphs that are not PCGs
• Some reduction operations to pairwise compatibility graphs
• A survey on pairwise compatibility graphs
• On graphs that are not PCGs
• Title not available (Why is that?)
• On pairwise compatibility graphs having Dilworth number two
• Discovering pairwise compatibility graphs
• Characterizing star-PCGs
• Pairwise compatibility graphs: a survey
• Pairwise Compatibility Graphs
• New results on pairwise compatibility graphs
• A Necessary Condition and a Sufficient Condition for Pairwise Compatibility Graphs
• Multi-interval pairwise compatibility graphs (extended abstract)
• Pairwise compatibility graphs
• On the pairwise compatibility property of some superclasses of threshold graphs
• Pairwise compatibility graphs: complete characterization for wheels
• Selecting Complementary Pairs of Literals
• On the enumeration of minimal non-pairwise compatibility graphs
• On the enumeration of minimal non-pairwise compatibility graphs

This page was built for publication: DISCOVERING PAIRWISE COMPATIBILITY GRAPHS

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