Discovering pairwise compatibility graphs

DOI10.1007/978-3-642-14031-0_43MaRDI QIDQ3578340zbMATH OpenOpenAlexFDO

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

Publication date 20 July 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-14031-0_43

Mathematics Subject Classification ID

Distance in graphs (05C12) Structural characterization of families of graphs (05C75)

Recommendations

• DISCOVERING PAIRWISE COMPATIBILITY GRAPHS
• Pairwise compatibility graphs: a survey
• Pairwise Compatibility Graphs
• Pairwise compatibility graphs
• A survey on pairwise compatibility graphs

Cited in

(8)

• Inferring phylogenetic trees from the knowledge of rare evolutionary events
• On graphs that are not PCGs
• Triangle-free outerplanar 3-graphs are pairwise compatibility graphs
• DISCOVERING PAIRWISE COMPATIBILITY GRAPHS
• Pairwise compatibility graphs: a survey
• On graphs that are not PCGs
• Pairwise Compatibility Graphs
• All graphs with at most 8 nodes are 2-interval-PCGs

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 Q3578340)