New results on pairwise compatibility graphs

DOI10.1016/j.ipl.2022.106284OpenAlexW4280538539MaRDI QIDQ2169428

Sheikh Azizul Hakim, Bishal Basak Papan, Md. Saidur Rahman

Publication date: 2 September 2022

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2205.04225

zbMATH Keywords

combinatorial problemssufficient conditiongrid graphnecessary conditionpairwise compatibility graph

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

On star-multi-interval pairwise compatibility graphs

Cites Work

• Unnamed Item
• Towards a characterization of leaf powers by clique arrangements
• Strictly chordal graphs are leaf powers
• Rooted directed path graphs are leaf powers
• Pairwise compatibility graphs
• Exploring pairwise compatibility graphs
• A method for enumerating pairwise compatibility graphs with a given number of vertices
• Exact-2-relation graphs
• Some classes of graphs that are not PCGs
• Basic graph theory
• On graphs that are not PCGs
• On pairwise compatibility graphs having Dilworth number two
• On Graph Powers for Leaf-Labeled Trees
• ON THE PAIRWISE COMPATIBILITY PROPERTY OF SOME SUPERCLASSES OF THRESHOLD GRAPHS
• Multi-interval Pairwise Compatibility Graphs
• DISCOVERING PAIRWISE COMPATIBILITY GRAPHS
• Pairwise Compatibility Graphs: A Survey
• Leaf Powers and Their Properties: Using the Trees
• Distance Approximating Trees for Chordal and Dually Chordal Graphs
• Triangle-Free Outerplanar 3-Graphs are Pairwise Compatibility Graphs
• Structure and linear-time recognition of 4-leaf powers
• A survey on pairwise compatibility graphs
• Ptolemaic Graphs and Interval Graphs Are Leaf Powers
• A Necessary Condition and a Sufficient Condition for Pairwise Compatibility Graphs
• Characterizing star-PCGs

This page was built for publication: New results on pairwise compatibility graphs