Containment Graphs, Posets, and Related Classes of Graphs
暂无分享,去创建一个
[1] Fred B. Schneider,et al. A Theory of Graphs , 1993 .
[2] Peter Buneman,et al. A characterisation of rigid circuit graphs , 1974, Discret. Math..
[3] A. Bonato,et al. Graphs and Hypergraphs , 2021, Clustering.
[4] Claude Berge,et al. Graphs and Hypergraphs , 2021, Clustering.
[5] William T. Trotter,et al. The dimension of a comparability graph , 1976 .
[6] P. Gilmore,et al. A Characterization of Comparability Graphs and of Interval Graphs , 1964, Canadian Journal of Mathematics.
[7] Jorge Urrutia,et al. Comparability graphs and intersection graphs , 1983, Discret. Math..
[8] Claude Berge,et al. The Theory Of Graphs , 1962 .
[9] Edward R. Scheinerman. Characterizing intersection classes of graphs , 1985, Discret. Math..
[10] M. Yannakakis. The Complexity of the Partial Order Dimension Problem , 1982 .
[11] Amir Pnueli,et al. Permutation Graphs and Transitive Graphs , 1972, JACM.
[12] Wojciech A. Trybulec. Partially Ordered Sets , 1990 .
[13] F. Gavril. The intersection graphs of subtrees in tree are exactly the chordal graphs , 1974 .
[14] M. Golumbic. Algorithmic graph theory and perfect graphs , 1980 .
[15] Oliver Pretzel,et al. On the Dimension of Partially Ordered Sets , 1977, J. Comb. Theory, Ser. A.
[16] A. Lempel,et al. Transitive Orientation of Graphs and Identification of Permutation Graphs , 1971, Canadian Journal of Mathematics.
[17] R. Möhring. Algorithmic graph theory and perfect graphs , 1986 .
[18] Martin Charles Golumbic,et al. Comparability graphs and a new matroid , 1977, J. Comb. Theory, Ser. B.