A Necessary Condition and a Sufficient Condition for Pairwise Compatibility Graphs

DOI10.1007/978-3-319-30139-6_9zbMath1479.05136OpenAlexW2491910870MaRDI QIDQ5890624

Sammi Abida Salma, Md. Saidur Rahman, Md. Iqbal Hossain

Publication date: 3 May 2016

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

Full work available at URL: https://doi.org/10.1007/978-3-319-30139-6_9

zbMATH Keywords

chordless cycleedge-weighted tree

Mathematics Subject Classification ID

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

Related Items (1)

Multi-interval Pairwise Compatibility Graphs

Cites Work

• Pairwise compatibility graphs
• Exploring pairwise compatibility graphs
• On graphs that are not PCGs
• On Relaxing the Constraints in Pairwise Compatibility Graphs
• DISCOVERING PAIRWISE COMPATIBILITY GRAPHS
• Triangle-Free Outerplanar 3-Graphs are Pairwise Compatibility Graphs

This page was built for publication: A Necessary Condition and a Sufficient Condition for Pairwise Compatibility Graphs