On the Ferrers dimension of a digraph
From MaRDI portal
Publication:1158180
DOI10.1016/0012-365X(82)90167-4zbMath0472.06007MaRDI QIDQ1158180
Publication date: 1982
Published in: Discrete Mathematics (Search for Journal in Brave)
Partial orders, general (06A06) Exact enumeration problems, generating functions (05A15) Directed graphs (digraphs), tournaments (05C20)
Related Items
Collapsing binary data for algebraic multidimensional representation, On the separation of two relations by a biorder or a semiorder, On finding the bidimension of a relation, Interval orders based on arbitrary ordered sets, Ferrers dimension of grid intersection graphs, Threshold Dimension of Graphs, On the structure of trapezoid graphs, Recognizing simple-triangle graphs by restricted 2-chain subgraph cover, A recognition algorithm for simple-triangle graphs, Permutation bigraphs and interval containments, Bi-semiorders with frontiers on finite sets, Sublinear approximation algorithms for boxicity and related problems, Forbidden substructure for interval digraphs/bigraphs, Finite dimensional scattered posets, Plural psychological developmental models: An ordinal generalization of the Guttman scale, Chain Representations of Nested Families of Biorders, Injective envelopes of transition systems and Ferrers languages, Dimension-2 poset competition numbers and dimension-2 poset double competition numbers, Ferrers dimension and boxicity, Convex geometry and group choice, On incomplete preference structures, Recognition and drawing of stick graphs, Grid intersection graphs and order dimension, The Number of Plane Diagrams of a Lattice, Two minimal forbidden subgraphs for double competition graphs of posets of dimension at most two, Matching relations and the dimensional structure of social choices, On Covering Numbers, Young Diagrams, and the Local Dimension of Posets, Characterizations and recognition of circular-arc graphs and subclasses: a survey, Dimension of valued relations, On realizable biorders and the biorder dimension of a relation, An interval digraph in relation to its associated bipartite graph, Interval dimension is a comparability invariant, Interval dimension and MacNeille completion, Efficient Algorithms for Maximum Induced Matching Problem in Permutation and Trapezoid Graphs
Cites Work
