On realizable biorders and the biorder dimension of a relation
暂无分享,去创建一个
[1] Ben Dushnik,et al. Partially Ordered Sets , 1941 .
[2] L. Guttman. A basis for scaling qualitative data. , 1944 .
[3] T. Hiraguchi. On the Dimension of Partially Ordered Sets. , 1951 .
[4] Clyde H. Coombs,et al. Nonmetric factor analysis , 1955 .
[5] O. Ore. Theory of Graphs , 1962 .
[6] P. Gilmore,et al. A Characterization of Comparability Graphs and of Interval Graphs , 1964, Canadian Journal of Mathematics.
[7] André Ducamp,et al. Sur la dimension d'un ordre partiel , 1967 .
[8] T. Gallai. Transitiv orientierbare Graphen , 1967 .
[9] P. Fishburn. Intransitive indifference with unequal indifference intervals , 1970 .
[10] A. Lempel,et al. Transitive Orientation of Graphs and Identification of Permutation Graphs , 1971, Canadian Journal of Mathematics.
[11] Peter C. Fishburn,et al. Partial orders of dimension 2 , 1972, Networks.
[12] William T. Trotter,et al. Maximal dimensional partially ordered sets II. characterization of 2n-element posets with dimension n , 1973, Discret. Math..
[13] P. Fishburn. Interval representations for interval orders and semiorders , 1973 .
[14] Claude Berge,et al. Graphs and Hypergraphs , 2021, Clustering.
[15] William T. Trotter,et al. Characterization problems for graphs, partially ordered sets, lattices, and families of sets , 1976, Discret. Math..
[16] William T. Trotter,et al. On the complexity of posets , 1976, Discret. Math..
[17] Martin Charles Golumbic,et al. Comparability graphs and a new matroid , 1977, J. Comb. Theory, Ser. B.
[18] B. Monjardet. Axiomatiques et propri?et?es des quasi-ordres , 1978 .
[19] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[20] Olivier Cogis,et al. On the Ferrers dimension of a digraph , 1982, Discret. Math..
[21] M. Yannakakis. The Complexity of the Partial Order Dimension Problem , 1982 .
[22] Olivier Cogis,et al. Ferrers digraphs and threshold graphs , 1982, Discret. Math..