Edge subdivision and dimension

DOI10.1007/BF00337619MaRDI QIDQ1108295zbMATH OpenFDO

Authors Jeremy P. Spinrad

Publication date 1988

Published in Order (Search for Journal in Brave)

zbMATH Keywords

dimensionheightpolynomial time algorithmN-free partial orders

Mathematics Subject Classification ID

Partial orders, general (06A06) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Dimension invariance of subdivisions
• The complexity of the partial order dimension problem: closing the gap
• scientific article; zbMATH DE number 1554930
• The Hardness of Approximating Poset Dimension
• The order dimension of divisibility

Cites work

• scientific article; zbMATH DE number 6157242 (Why is no real title available?)
• A bound on the dimension of interval orders
• An upper bound on the dimension of interval orders
• Partially Ordered Sets

Cited in

(5)

• Dimension invariance of subdivisions
• Total edge irregularity strength of subdivision of star
• Computing the dimension of N-free ordered sets is NP-complete
• Posets with cover graph of pathwidth two have bounded dimension
• Separability, boxicity, and partial orders

This page was built for publication: Edge subdivision and dimension

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1108295)