The relationship between the threshold dimension of split graphs and various dimensional parameters

DOI10.1016/0166-218X(91)90038-XzbMath0727.05058MaRDI QIDQ803177

Margaret B. Cozzens, Mark D. Halsey

Publication date: 1991

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

boxicitythreshold dimension

Mathematics Subject Classification ID

Graph theory (05C99)

Related Items (4)

The hardness of approximating the boxicity, cubicity and threshold dimension of a graph ⋮ Sublinear approximation algorithms for boxicity and related problems ⋮ The lexicographic method for the threshold cover problem ⋮ Cubicity of threshold graphs

Cites Work

• Computing the boxicity of a graph by covering its complement by cointerval graphs
• Multidimensional scaling and threshold graphs
• On the complexity of posets
• Threshold Dimension of Graphs
• The Complexity of the Partial Order Dimension Problem
• Bithreshold Graphs
• Sufficient Conditions for Graphs to Have Threshold Number 2
• A Characterization of Comparability Graphs and of Interval Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The relationship between the threshold dimension of split graphs and various dimensional parameters