Representing digraphs using intervals or circular arcs
暂无分享,去创建一个
[1] Fred R. McMorris,et al. Subpath acyclic digraphs , 1996, Discret. Math..
[2] R. Möhring. Algorithmic graph theory and perfect graphs , 1986 .
[3] Douglas B. West,et al. The interval inclusion number of a partially ordered set , 1991, Discret. Math..
[4] Malay K. Sen,et al. Indifference Digraphs: A Generalization of Indifference Graphs and Semiorders , 1994, SIAM J. Discret. Math..
[5] Olivier Cogis,et al. Ferrers digraphs and threshold graphs , 1982, Discret. Math..
[6] L. Guttman. A basis for scaling qualitative data. , 1944 .
[7] Martin Charles Golumbic. Interval graphs and related topics , 1985, Discret. Math..
[8] Douglas B. West,et al. Interval digraphs: An analogue of interval graphs , 1989, J. Graph Theory.
[9] Wojciech A. Trybulec. Partially Ordered Sets , 1990 .
[10] Jean-Paul Doignon,et al. On realizable biorders and the biorder dimension of a relation , 1984 .
[11] A. Tucker,et al. Matrix characterizations of circular-arc graphs , 1971 .
[12] Douglas B. West,et al. Circular-arc digraphs: A characterization , 1989, J. Graph Theory.