scientific article; zbMATH DE number 1161251
From MaRDI portal
Publication:4393243
zbMath0902.05038MaRDI QIDQ4393243
Publication date: 10 December 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
posetdimensionplanar graphsRamsey theorychromatic numberrandom graphlinear extensionhypergraph coloringrandom posetHamiltonian cycles and paths
Extremal problems in graph theory (05C35) Combinatorics of partially ordered sets (06A07) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Eulerian and Hamiltonian graphs (05C45)
Related Items (8)
Computational aspects of the 2-dimension of partially ordered sets ⋮ On the complexity of cover-incomparability graphs of posets ⋮ 2-dimension from the topological viewpoint ⋮ The Hardness of Approximating Poset Dimension ⋮ The Complexity of the Partial Order Dimension Problem: Closing the Gap ⋮ Cover-incomparability graphs of posets ⋮ Better bounds for poset dimension and boxicity ⋮ Finite three-dimensional partial orders which are not sphere orders
This page was built for publication:
