Pages that link to "Item:Q1158180"
From MaRDI portal
The following pages link to On the Ferrers dimension of a digraph (Q1158180):
Displaying 34 items.
- Ferrers dimension of grid intersection graphs (Q344841) (← links)
- Permutation bigraphs and interval containments (Q401140) (← links)
- Convex geometry and group choice (Q585057) (← links)
- On incomplete preference structures (Q585061) (← links)
- Ferrers dimension and boxicity (Q708404) (← links)
- Grid intersection graphs and order dimension (Q722596) (← links)
- Matching relations and the dimensional structure of social choices (Q760319) (← links)
- Interval dimension is a comparability invariant (Q804609) (← links)
- Bi-semiorders with frontiers on finite sets (Q894091) (← links)
- Forbidden substructure for interval digraphs/bigraphs (Q898169) (← links)
- Plural psychological developmental models: An ordinal generalization of the Guttman scale (Q912035) (← links)
- Dimension-2 poset competition numbers and dimension-2 poset double competition numbers (Q968201) (← links)
- Two minimal forbidden subgraphs for double competition graphs of posets of dimension at most two (Q1023063) (← links)
- Characterizations and recognition of circular-arc graphs and subclasses: a survey (Q1045049) (← links)
- On realizable biorders and the biorder dimension of a relation (Q1057213) (← links)
- Collapsing binary data for algebraic multidimensional representation (Q1081564) (← links)
- On the separation of two relations by a biorder or a semiorder (Q1087450) (← links)
- On finding the bidimension of a relation (Q1099113) (← links)
- An interval digraph in relation to its associated bipartite graph (Q1313853) (← links)
- Interval dimension and MacNeille completion (Q1318360) (← links)
- Dimension of valued relations (Q1582042) (← links)
- Sublinear approximation algorithms for boxicity and related problems (Q1693125) (← links)
- Interval orders based on arbitrary ordered sets (Q1898345) (← links)
- On the structure of trapezoid graphs (Q1917308) (← links)
- Recognizing simple-triangle graphs by restricted 2-chain subgraph cover (Q2181225) (← links)
- A recognition algorithm for simple-triangle graphs (Q2185743) (← links)
- Finite dimensional scattered posets (Q2434747) (← links)
- Threshold Dimension of Graphs (Q3204506) (← links)
- Injective envelopes of transition systems and Ferrers languages (Q3298124) (← links)
- On Covering Numbers, Young Diagrams, and the Local Dimension of Posets (Q4990391) (← links)
- Efficient Algorithms for Maximum Induced Matching Problem in Permutation and Trapezoid Graphs (Q5025046) (← links)
- Chain Representations of Nested Families of Biorders (Q5132598) (← links)
- The Number of Plane Diagrams of a Lattice (Q5445327) (← links)
- Recognition and drawing of stick graphs (Q5915944) (← links)
