scientific article; zbMATH DE number 1161251
From MaRDI portal
Publication:4393243
Recommendations
Cited in
(14)- On the complexity of cover-incomparability graphs of posets
- Cover-incomparability graphs of posets
- The Hardness of Approximating Poset Dimension
- Finite three-dimensional partial orders which are not sphere orders
- Some new results on cluttered ordering on several special bipartite graphs
- The complexity of the partial order dimension problem: closing the gap
- 2-dimension from the topological viewpoint
- scientific article; zbMATH DE number 4156479 (Why is no real title available?)
- scientific article; zbMATH DE number 3877239 (Why is no real title available?)
- scientific article; zbMATH DE number 3912404 (Why is no real title available?)
- scientific article; zbMATH DE number 3972916 (Why is no real title available?)
- Computational aspects of the 2-dimension of partially ordered sets
- New ordering methods to construct contagious sets and induced degenerate subgraphs
- Better bounds for poset dimension and boxicity
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4393243)