The following pages link to (Q4004146):
Displaying 50 items.
- Vertex coloring acyclic digraphs and their corresponding hypergraphs (Q944747) (← links)
- Schnyder woods and orthogonal surfaces (Q946686) (← links)
- Unit and proper tube orders (Q953272) (← links)
- Adjacency posets of planar graphs (Q966048) (← links)
- Dimension-2 poset competition numbers and dimension-2 poset double competition numbers (Q968201) (← links)
- Aggregation of binary evaluations with abstentions (Q969118) (← links)
- Error-free milestones in error prone measurements (Q985011) (← links)
- Making choices with a binary relation: relative choice axioms and transitive closures (Q992691) (← links)
- Critically prime interval orders (Q998455) (← links)
- Single machine precedence constrained scheduling is a Vertex cover problem (Q1016523) (← links)
- A bipartite analogue of Dilworth's theorem for multiple partial orders (Q1041604) (← links)
- Bandwidth of bipartite permutation graphs in polynomial time (Q1044045) (← links)
- Characterizations and recognition of circular-arc graphs and subclasses: a survey (Q1045049) (← links)
- Rough sets determined by quasiorders (Q1047187) (← links)
- Fundamentals of planar ordered sets (Q1086596) (← links)
- A characteristic property of labelings and linear extensions of posets of dimension 2 (Q1276391) (← links)
- Boolean layer cakes (Q1285779) (← links)
- Algorithms for the fixed point property (Q1285782) (← links)
- Split semiorders (Q1296976) (← links)
- On maximal sublattices of finite lattices (Q1297438) (← links)
- The maximum number of edges in a graph of bounded dimension, with applications to ring theory (Q1301725) (← links)
- Forbidden induced partial orders (Q1301728) (← links)
- Finite three-dimensional partial orders which are not sphere orders (Q1301732) (← links)
- The order dimension of the complete graph (Q1301733) (← links)
- The fractional dimension of subsets of Boolean lattices and cartesian products (Q1301736) (← links)
- Posets with large dimension and relatively few critical pairs (Q1319081) (← links)
- Irrepresentability of short semilattices by Euclidean subspaces (Q1333298) (← links)
- The order dimension of two levels of the Boolean lattices (Q1337568) (← links)
- The dimension of interior levels of the Boolean lattice (Q1337570) (← links)
- 3-interval irreducible partially ordered sets (Q1338127) (← links)
- The dimension of suborders of the Boolean lattice (Q1338128) (← links)
- Incidence posets of trees in posets of large dimension (Q1338131) (← links)
- On the fractional dimension of partially ordered sets (Q1344614) (← links)
- Width two posets are reconstructible (Q1356683) (← links)
- Partial orders and their convex subsets (Q1356772) (← links)
- Well-graded families of relations (Q1367025) (← links)
- Stochastic token theory (Q1368382) (← links)
- Patterns that preserve sparsity in orthogonal factorization (Q1375102) (← links)
- Concordance between two linear orders: The Spearman and Kendall coefficients revisited (Q1378870) (← links)
- On \(k\)-weak orders: Recognition and a tolerance result (Q1381859) (← links)
- Generalizations of semiorders: A review note (Q1384555) (← links)
- On-line algorithms for orders (Q1392200) (← links)
- On-line chain partitions of orders (Q1392205) (← links)
- On treewidth and minimum fill-in of asteroidal triple-free graphs (Q1392207) (← links)
- Soft dimension theory. (Q1398925) (← links)
- Searching for the dimension of valued preference relations. (Q1401118) (← links)
- Reconstruction of finite truncated semi-modular lattices (Q1403920) (← links)
- Total nonnegativity and (3+1)-free posets (Q1406738) (← links)
- The order dimension of the poset of regions in a hyperplane arrangement. (Q1421332) (← links)
- Split orders (Q1422429) (← links)
