Edge subdivision and dimension

DOI10.1007/BF00337619zbMath0654.06002MaRDI QIDQ1108295

Jeremy P. Spinrad

Publication date: 1988

Published in: Order (Search for Journal in Brave)

zbMATH Keywords

heightdimensionpolynomial time algorithmN-free partial orders

Mathematics Subject Classification ID

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

Related Items (4)

Posets with cover graph of pathwidth two have bounded dimension ⋮ Separability, boxicity, and partial orders ⋮ Dimension invariance of subdivisions ⋮ Computing the dimension of N-free ordered sets is NP-complete

Cites Work

• Unnamed Item
• A bound on the dimension of interval orders
• An upper bound on the dimension of interval orders
• Partially Ordered Sets

This page was built for publication: Edge subdivision and dimension