References
- Basu, A., Das, S., Ghosh, S., Sen, M. (2013). Circular-arc bigraphs and its subclasses. J. Graph Theory 73(4): 361–376.
- Bogart, K. P., West, D. B. (1999). A short proof that “proper = unit”. Discrete Math 201: 21–23.
- Catanzaro, D., Chaplick, S., Felsner, S., Halldórsson, B. V., Halldórsson, M. M., Hixon, T., Stacho, J. (2017). Max point-tolerance graphs. Discrete Appl. Math. 216: 84–97.
- Corneil, D. G., Olariu, S., Stewart, L. (1997). Asteroidal triple-free graphs. Siam J. Discrete Math. 10: 399–430.
- Fishburn, P. (1985). Interval Orders and Interval Graphs—A Study of Partially Ordered Sets, New York: Wiley.
- Fulkerson, D. R., Gross, O. A. (1965). Incidence matrices and interval graphs. Pac. J. Math. 15: 835–855.
- Golumbic, M. C. (2004). Algorithmic Graph Theory and Perfect Graphs, Vol. 57: Annals of Discrete Mathematics. New York: Elsevier Science.
- Golumbic, M. C., Monma, C. L. (1982). A generalization of interval graphs with tolerances. Congress. Numer. 35: 321–331.
- Golumbic, M. C., Trenk, A. (2004). Tolerance Graphs. Cambridge Studies in Advanced Mathematics 89. New York: Cambridge University Press.
- Ghosh, S., Podder, M., Sen, M. K. (2010). Adjacency matrices of probe interval graphs. Discrete Appl. Math. 158: 2004–2013.
- Kaufmann, M., Kratochvil, J., Lehmann, K. A., Subramanian, A. R. (2006). Max-tolerance graphs as intersection graphs: Cliques, cycles, and recognition. Paper presented at SODA ’06, January 22–26, Miami, FL.
- Lekkerkerker, C. G., Boland, J. C. (1962). Representation of a finite graph by a set of intervals on the real line. Fund. Math. 51: 45–64.
- Paul, S. (2020). On central-max-point tolerance graphs. AKCE Int. J. Graphs Comb. 17(3): 1069–1075.
- Sen, M., Das, S., Roy, A. B., West, D. B. (1989). Interval digraphs: an analogue of interval graphs. J. Graph Theory 13(2): 189–202.
- Soto, M., Caro, C. T. (2015). p− Box: A new graph model. J. Discrete Math. Theor. Comput. Sci. 17: 169–186.