Publisher
Springer International Publishing
Reference17 articles.
1. Chvátal, V., Hammer, P.L.: Aggregation of inequalities in integer programming. In: Hammer, P.L., Johnson, E.L., Korte, B.H., Nemhauser, G.L. (eds.) Annals of Discrete Mathematics. Studies in Integer Programming, vol. 1, pp. 145–162. Elsevier (1977). https://doi.org/10.1016/S0167-5060(08)70731-3
2. Corneil, D.G.: A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs. Discret. Appl. Math. 138(3), 371–379 (2004). https://doi.org/10.1016/j.dam.2003.07.001
3. Deng, X., Hell, P., Huang, J.: Linear-time representation algorithms for proper circular-Arc graphs and proper interval graphs. SIAM J. Comput. 25(2), 390–403 (1996). https://doi.org/10.1137/S0097539792269095
4. Foldes, S., Hammer, P.L.: Split graphs. In: Proceedings of the 8th Southeastern Conference on Combinatorics, Graph Theory and Computing, Congressus Numerantium, vol. XIX, pp. 311–315 (1977)
5. Gilmore, P.C., Hoffman, A.J.: A characterization of comparability graphs and of interval graphs. Can. J. Math. 16, 539–548 (1964). https://doi.org/10.4153/CJM-1964-055-5