scientific article

Publication date: 18 September 1992

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

combinatorics computational complexity planar graphs trees partially ordered sets lattices planar maps convex polytopes families of sets probabilistic methods dimension theory hypergraph coloring irreducible posets planar posets products of chains back-tracking Greedy dimension Greedy linear extensions linear extension algorithm

Mathematics Subject Classification ID

Partial orders, general (06A06) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Combinatorics of partially ordered sets (06A07) Graph theory (05Cxx) Research exposition (monographs, survey articles) pertaining to ordered structures (06-02)

Related Items (only showing first 100 items - show all)

Geometric inequalities for anti-blocking bodies ⋮ Note on strong product graph dimension ⋮ Three Fuss-Catalan posets in interaction and their associative algebras ⋮ Unnamed Item ⋮ Weak$^*$ closures and derived sets for convex sets in dual Banach spaces ⋮ Vertex decomposable graphs and obstructions to shellability ⋮ Posets and planar graphs ⋮ Two lower bounds for the Stanley depth of monomial ideals ⋮ Ramsey properties of products of chains ⋮ On the square coloring of comparability graphs ⋮ On Strict (Outer-)Confluent Graphs ⋮ On the Galois Lattice of Bipartite Distance Hereditary Graphs ⋮ A characterization of two-agent Pareto representable orderings ⋮ Graphs of bounded depth‐2 rank‐brittleness ⋮ Topological Aspects of Matrix Abduction 1 ⋮ Topological Aspects of Matrix Abduction 2 ⋮ The Hardness of Approximating Poset Dimension ⋮ Linear-Interval Dimension and PI Orders ⋮ Order-sensitive domination in partially ordered sets and graphs ⋮ The Complexity of the Partial Order Dimension Problem: Closing the Gap ⋮ Geometric realizations of Tamari interval lattices via cubic coordinates ⋮ Drawing Order Diagrams Through Two-Dimension Extension ⋮ Dimension is polynomial in height for posets with planar cover graphs ⋮ Face posets of tropical polyhedra and monomial ideals ⋮ Bipolar preference modeling and aggregation in decision support ⋮ On String Graph Limits and the Structure of a Typical String Graph ⋮ A multidimensional view on poverty in the European Union by partial order theory ⋮ String graphs and incomparability graphs ⋮ Covering Energy of Some Classes of Posets ⋮ Path homomorphisms ⋮ Characterizing graphs of critical pairs of layered generalized crowns ⋮ The random binary growth model ⋮ Cyclic Extensions of Order Varieties ⋮ The duality between the anti-exchange closure operators and the path independent choice operators on a finite set ⋮ Partial order bounding: A new approach to evaluation in game tree search ⋮ Transitive-Closure Spanners: A Survey ⋮ AN ALGORITHMIC APPROACH TO PREFERENCE REPRESENTATION ⋮ Dyck paths and positroids from unit interval orders ⋮ Chi-boundedness of graph classes excluding wheel vertex-minors ⋮ Why Is Pi Less Than Twice Phi? ⋮ On low rank-width colorings ⋮ Representation of Planar Hypergraphs by Contacts of Triangles ⋮ Poset entropy versus number of linear extensions: the width-2 case. ⋮ Posets and VPG graphs ⋮ Dimension and matchings in comparability and incomparability graphs. ⋮ Cover matrices of posets and their spectra ⋮ Generalized Polychotomic Encoding: A Very Short Bit-Vector Encoding of Tree Hierarchies ⋮ Better bounds for poset dimension and boxicity ⋮ Finite paths are universal ⋮ Finite paths are universal ⋮ Alternation Graphs ⋮ A study of the order dimension of a poset using matrices ⋮ IRREDUCIBLE QUASIORDERS OF MONOUNARY ALGEBRAS ⋮ Linear Extension Diameter of Downset Lattices of 2-Dimensional Posets ⋮ Block circulant graphs and the graphs of critical pairs of crowns ⋮ Faithful extensions on finite orders classes ⋮ Unnamed Item ⋮ Infinite dimensionality of the post-processing order of measurements on a general state space ⋮ Stochastic monotonicity and realizable monotonicity ⋮ The facets and the symmetries of the approval-voting polytope ⋮ Pattern avoidance and the Bruhat order. ⋮ Tight bounds to localize failure nodes on trees, grids and through embeddings under Boolean network tomography ⋮ On-line dimension of semi-orders ⋮ Upper maximal graphs of posets ⋮ Complexity reduction and approximation of multidomain systems of partially ordered data ⋮ 2-dimension from the topological viewpoint ⋮ A half-space approach to order dimension ⋮ Trees as semilattices ⋮ The first three levels of an order preserving Hamiltonian path in the subset lattice ⋮ On the order dimension of 1-sets versus $k$-sets ⋮ Balancing pairs and the cross product conjecture ⋮ Automorphism group and dimension of ordered sets ⋮ Dimension of restricted classes of interval orders ⋮ Doppelgänger entropies ⋮ Adjacency posets of outerplanar graphs ⋮ Uniform random posets ⋮ Dimension of CPT posets ⋮ Planar posets that are accessible from below have dimension at most 6 ⋮ Containment graphs and posets of paths in a tree: wheels and partial wheels ⋮ On the dimension of posets with cover graphs of treewidth 2 ⋮ Boolean lattices: Ramsey properties and embeddings ⋮ Resolutions of convex geometries ⋮ Coherence conditions for preference modeling with ordered points ⋮ Recognizing simple-triangle graphs by restricted 2-chain subgraph cover ⋮ On polygon numbers of circle graphs and distance hereditary graphs ⋮ Fixed point property for finite ordered sets that contain no crowns with 6 or more elements ⋮ Interval-valued rank in finite ordered sets ⋮ On scattered convex geometries ⋮ Trees and circle orders ⋮ Dushnik-Miller dimension of TD-Delaunay complexes ⋮ Necessary and possible indifferences ⋮ On-line dimension for posets excluding two long incomparable chains ⋮ Finite dimensional scattered posets ⋮ On strict (outer-)confluent graphs ⋮ 4-connected triangulations on few lines ⋮ Timestamping messages and events in a distributed system using synchronous communication ⋮ One-sided weak dominance drawing ⋮ Factorizing Boolean matrices using formal concepts and iterative usage of essential entries ⋮ Local dimension is unbounded for planar posets ⋮ On the vertex ranking problem for trapezoid, circular-arc and other graphs

This page was built for publication: