DISCOVERING PAIRWISE COMPATIBILITY GRAPHS
From MaRDI portal
Publication:3084693
DOI10.1142/S1793830910000917zbMath1216.05138MaRDI QIDQ3084693
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)
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)
Related Items
On pairwise compatibility graphs having Dilworth number two ⋮ Pairwise Compatibility Graphs: A Survey ⋮ New results on pairwise compatibility graphs ⋮ Pairwise compatibility graphs: complete characterization for wheels ⋮ Multi-interval Pairwise Compatibility Graphs ⋮ On pairwise compatibility graphs having Dilworth number \(k\) ⋮ Some classes of graphs that are not PCGs ⋮ Characterizing star-PCGs ⋮ On graphs that are not PCGs ⋮ A Necessary Condition and a Sufficient Condition for Pairwise Compatibility Graphs ⋮ On the enumeration of minimal non-pairwise compatibility graphs ⋮ On the enumeration of minimal non-pairwise compatibility graphs ⋮ ON THE PAIRWISE COMPATIBILITY PROPERTY OF SOME SUPERCLASSES OF THRESHOLD GRAPHS ⋮ Some reduction operations to pairwise compatibility graphs ⋮ A survey on pairwise compatibility graphs
Cites Work
This page was built for publication: DISCOVERING PAIRWISE COMPATIBILITY GRAPHS
