Bigraphs/digraphs of Ferrers dimension 2 and asteroidal triple of edges
暂无分享,去创建一个
[1] Haiko Müller,et al. Recognizing Interval Digraphs and Interval Bigraphs in Polynomial Time , 1997, Discret. Appl. Math..
[2] M. Golumbic. Algorithmic graph theory and perfect graphs , 1980 .
[3] Douglas B. West,et al. Representing digraphs using intervals or circular arcs , 1995, Discret. Math..
[4] Martin Charles Golumbic,et al. Perfect Elimination and Chordal Bipartite Graphs , 1978, J. Graph Theory.
[5] George Steiner. The recognition of indifference digraphs and generalized semiorders , 1996, J. Graph Theory.
[6] George Steiner. The recognition of indifference digraphs and generalized semiorders , 1996 .
[7] Douglas B. West,et al. Interval digraphs: An analogue of interval graphs , 1989, J. Graph Theory.
[8] M. Golumbic. Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57) , 2004 .
[9] Jean-Paul Doignon,et al. On realizable biorders and the biorder dimension of a relation , 1984 .
[10] C. Lekkeikerker,et al. Representation of a finite graph by a set of intervals on the real line , 1962 .
[11] André Bouchet,et al. Etude combinatoire des ordonnés finis , 1971 .