The following pages link to (Q4004146):
Displaying 21 items.
- Finite paths are universal (Q5921694) (← links)
- The duality between the anti-exchange closure operators and the path independent choice operators on a finite set (Q5932330) (← links)
- Partial order bounding: A new approach to evaluation in game tree search (Q5941319) (← links)
- Poset entropy versus number of linear extensions: the width-2 case. (Q5965137) (← links)
- Posets and VPG graphs (Q5965140) (← links)
- Dimension and matchings in comparability and incomparability graphs. (Q5965146) (← links)
- A characterization of two-agent Pareto representable orderings (Q6050994) (← links)
- Graphs of bounded depth‐2 rank‐brittleness (Q6055398) (← links)
- Order-sensitive domination in partially ordered sets and graphs (Q6105038) (← links)
- Geometric realizations of Tamari interval lattices via cubic coordinates (Q6139861) (← links)
- Drawing Order Diagrams Through Two-Dimension Extension (Q6181952) (← links)
- Dimension is polynomial in height for posets with planar cover graphs (Q6187346) (← links)
- Vertex ranking of asteroidal triple-free graphs (Q6487437) (← links)
- An approach to distributed systems from orderings and representability (Q6563294) (← links)
- Contiguity orders (Q6567688) (← links)
- Gallai-like characterization of strong cocomparability graphs (Q6595514) (← links)
- Word-representability of graphs with respect to split recomposition (Q6611031) (← links)
- Dushnik-Miller dimension of stair contact complexes (Q6621223) (← links)
- Containment orders – a lifelong journey (Q6643354) (← links)
- On locally finite ordered rooted trees and their rooted subtrees (Q6648245) (← links)
- Dimension bounds on classes of interval orders with restricted representation (Q6650726) (← links)
