On pairwise compatibility graphs having Dilworth number \(k\)

DOI10.1016/j.tcs.2014.06.024zbMath1420.05046OpenAlexW4252468146MaRDI QIDQ2253200

Tiziana Calamoneri, Rossella Petreschi

Publication date: 25 July 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2014.06.024

zbMATH Keywords

Dilworth numberpairwise compatibility graphsleaf power graphsminimum leaf power graphs

Mathematics Subject Classification ID

Distance in graphs (05C12)

Related Items (7)

Pairwise Compatibility Graphs: A Survey ⋮ Serial and parallel kernelization of multiple hitting set parameterized by the Dilworth number, implemented on the GPU ⋮ On dynamic threshold graphs and related classes ⋮ Some classes of graphs that are not PCGs ⋮ Characterizing star-PCGs ⋮ On graphs that are not PCGs ⋮ Some reduction operations to pairwise compatibility graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Graph classes with structured neighborhoods and algorithmic applications
• Pairwise compatibility graphs
• Perfectness and Dilworth number
• A note on perfect orders
• Recognition algorithms for orders of small width and graphs of small Dilworth number
• Threshold graphs and related topics
• Exploring pairwise compatibility graphs
• 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
• DISCOVERING PAIRWISE COMPATIBILITY GRAPHS
• Threshold characterization of graphs with dilworth number two
• The Dilworth Number of a Graph
• Tree Powers
• Graph Classes: A Survey
• On Graphs That Are Not PCGs
• Ptolemaic Graphs and Interval Graphs Are Leaf Powers
• Difference graphs

This page was built for publication: On pairwise compatibility graphs having Dilworth number \(k\)