On Graphs That Are Not PCGs

DOI10.1007/978-3-642-36065-7_29zbMath1379.05050OpenAlexW2172851429WikidataQ60608628 ScholiaQ60608628MaRDI QIDQ4914459

Stephane Durocher, Md. Saidur Rahman, Debajyoti Mondal

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)

Related Items (5)

On pairwise compatibility graphs having Dilworth number two ⋮ Pairwise Compatibility Graphs: A Survey ⋮ Inferring phylogenetic trees from the knowledge of rare evolutionary events ⋮ On pairwise compatibility graphs having Dilworth number \(k\) ⋮ On graphs that are not PCGs

This page was built for publication: On Graphs That Are Not PCGs