On graphs that are not PCGs

DOI10.1007/978-3-642-36065-7_29MaRDI QIDQ4914459zbMATH OpenOpenAlexWikidataFDO

Authors Stephane Durocher, Debajyoti Mondal, Md. Saidur Rahman

Publication date 12 April 2013

Published in WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-36065-7_29

Mathematics Subject Classification ID

Distance in graphs (05C12) Signed and weighted graphs (05C22)

Recommendations

• On graphs that are not PCGs
• Some classes of graphs that are not PCGs
• Pairwise compatibility graphs
• Pairwise Compatibility Graphs
• Discovering pairwise compatibility graphs

Cited in

(8)

• Graphs that are not pairwise compatible: a new proof technique (extended abstract)
• Inferring phylogenetic trees from the knowledge of rare evolutionary events
• On pairwise compatibility graphs having Dilworth number k
• Some classes of graphs that are not PCGs
• On graphs that are not PCGs
• On pairwise compatibility graphs having Dilworth number two
• Pairwise compatibility graphs: a survey
• On Lict sigraphs

This page was built for publication: On graphs that are not PCGs

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