References
- [1] K.S. Booth, G.S. Lucker, Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms, J. Comput. System Sci., 13(1976), 335-379.
- [2] D.A. Cox, A. Erskine, On closed graphs, Ars Combinatoria, to appear, preprint available at arXiv:1306.5149v1 [math.CO].
- [3] M. Crupi, G. Rinaldo, Binomial edge ideals with quadratic Gröbner bases, The Elec. J. of Comb. 8, P#211 (2011), 1-13.
- [4] M. Crupi, G. Rinaldo, Closed graphs are proper interval graphs, An.St Univ. Ovidius Constantia, 22(3) (2014), 37-44.
- [5] X. Deng, P. Hell, J. Huang, Linear-time representation algorithms for proper circular-arc graphs and proper interval graphs, SIAM J. Comput., 25(2) (1996), 390-403.10.1137/S0097539792269095
- [6] F. Gardi, The Roberts characterization of proper and unit interval graphs, Discr. Math., 307(22) (2007), 2906-2908.
- [7] M.C. Golumbic, Algorithm Graph Theory and Perfect graphs. Academic Press, New York, N.Y., 1980.
- [8] P.C. Gilmore, A.J. Ho_man, A characterization of comparability graphs and of interval graphs, Canad. J. Math., 16 (1964), 539-548.
- [9] V. Ene, J. Herzog, T. Hibi, Cohen-Macaulay binomial edge ideals, Nagoya Math. J. ,204 (2011), 57-68.
- [10] M. Habib, R. McConnel C. Paul, L. Viennot, Lex-BFS and partition re- _nement, with applications to transitive orientation, interval graph recognition, and consecutive one testing, Theoret. Comput. Sci., 234 (2000), 59-84.
- [11] P. Heggernes, D. Meister, C. Papadopoulos, A new representation of proper interval graphs with an application to clique-width, DIMAP Workshop on Algorithmic Graph Theory 2009, Electron. Notes Discrete Math., 32, (2009), 27-34.10.1016/j.endm.2009.02.005
- [12] J. Herzog, T. Hibi, F. Hreinsdottir, T. Kahle, J. Rauh, Binomial edge ideals and conditional independence statements, Adv. in Appl. Math., 45 (2010), 317-333.
- [13] P. J. Looges, S. Olariu, Optimal greedy algorithms for indi_erence graphs, Comput. Math. Appl., 25 (1993), 15-25.10.1016/0898-1221(93)90308-I
- [14] K. Matsuda, Weakly closed graphs and F-purity of binomial edge ideals, preprint available at arXiv:1209.4300v1 [Math:AC].
- [15] S. Olariu, An optimal greedy euristic to color interval grphs graphs, Inform. Process. Lett., 31 (1991), 21-25.10.1016/0020-0190(91)90245-D
- [16] B.S. Panda, S.K. Das, A linear time recognition algorithm for proper interval graphs, Inform. Process. Lett., 87 (2003), 153-161.
- [17] F.S. Roberts, Graph theory and its application to problem of society, SIAM Press, Philadelphia (PA), 1978.