On pairwise compatibility graphs having Dilworth number two

DOI10.1016/j.tcs.2013.12.015zbMath1283.05142OpenAlexW2000209284MaRDI QIDQ2637346

Tiziana Calamoneri, Rossella Petreschi

Publication date: 11 February 2014

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

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

zbMATH Keywords

interval graphsDilworth numberpairwise compatibility graphsthreshold signed graphsleaf power graphsminimum leaf power graphssplit permutation graphs

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Distance in graphs (05C12) Vertex degrees (05C07)

Related Items

Pairwise Compatibility Graphs: A Survey ⋮ New results on pairwise compatibility graphs ⋮ Algorithms for area-efficient orthogonal drawing ⋮ Pairwise compatibility graphs: complete characterization for wheels ⋮ Corrigendum to: ``On pairwise compatibility graphs having Dilworth number two ⋮ On pairwise compatibility graphs having Dilworth number \(k\) ⋮ The DFS-heuristic for orthogonal graph drawing ⋮ Some classes of graphs that are not PCGs ⋮ Characterizing star-PCGs ⋮ On graphs that are not PCGs ⋮ Some reduction operations to pairwise compatibility graphs ⋮ A survey on pairwise compatibility graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Pairwise compatibility graphs
• Split graphs of Dilworth number 2
• Exploring pairwise compatibility graphs
• On Relaxing the Constraints in Pairwise Compatibility 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
• On Dilworth k Graphs and Their Pairwise Compatibility

This page was built for publication: On pairwise compatibility graphs having Dilworth number two