Axiomatic characterization of the interval function of partial cubes and partial Hamming graphs

References

• Aurenhammer, F., Formann, M., Idury, R. M., Schäffer, A. A, Wagner, F. (1994). Faster isometric embedding in products of complete graphs. Discrete Appl. Math 52(1): 17–28.
   Web of Science ®Google Scholar
• Avis, D. (1981). Hypermetric spaces and the Hamming cone. Can. j. Math. 33(4): 795–802.
   Web of Science ®Google Scholar
• Balakrishnan, K., Changat, M., Lakshmikuttyamma, A. K., Mathew, J., Mulder, H. M., Narasimha-Shenoi, P. G, Narayanan, N. (2015). Axiomatic characterization of the interval function of a block graph. Discrete Math 338(6): 885–894.
   Web of Science ®Google Scholar
• Bandelt, H.-J., Chepoi, V., Dress, A, Koolen, J. (2006). Combinatorics of lopsided sets. Eur. J. Comb 27(5): 669–689.
   Web of Science ®Google Scholar
• Chalopin, J., Changat, M., Chepoi, V, Jacob, J. (2022). First-order logic axiomatization of metric graph theory, arXiv preprint arXiv:2203.01070.
   Google Scholar
• Changat, M., Nezhad, F. H., Mulder, H. M, Narayanan, N. (2018). A note on the interval function of a disconnected graph. Discuss. Math. Graph Theory 38(1): 39–48.
   Web of Science ®Google Scholar
• Changat, M., Nezhad, F. H, Narayanan, N. (2020). Axiomatic characterization of the interval function of a bipartite graph. Discrete Appl. Math 286: 19–28.
   Web of Science ®Google Scholar
• Changat, M., Narasimha-Shenoi, P. G, Seethakuttyamma, G. (2019). Betweenness in graphs: A short survey on shortest and induced path betweenness. AKCE Int J Graphs Comb 16(1): 90–109.
   Web of Science ®Google Scholar
• Changat, M., Nezhad, F. H, Narayanan, N. (2020). Interval function, induced path function,(claw, paw)-free graphs and axiomatic characterizations. Discrete Appl. Math 280: 53–62.
   Web of Science ®Google Scholar
• Chepoi, V. (1988). Isometric subgraphs of Hamming graphs and d-convexity. Cybern. Syst. Anal. 24(1): 6–11.
   Google Scholar
• Chepoi, V. (1994). Separation of two convex sets in convexity structures. J. Geom. 50(1-2): 30–51.
   Google Scholar
• Chepoi, V. (1988). Isometric subgraphs of Hamming graphs and d-convexity. Cybern. Syst. Anal. 24(1): 6–11.
   Google Scholar
• Chepoi, V, Klavžar, S. (1997). The Wiener index and the Szeged index of benzenoid systems in linear time. J. Chem. Inf. Comput. Sci. 37(4): 752–755.
   Google Scholar
• Djoković, D. Ž. (1973). Distance–preserving subgraphs of hypercubes. J. Comb. Th. Ser. B 14(3): 263–267.
   Google Scholar
• Eppstein, D. (2011). Recognizing partial cubes in quadratic time. Jgaa. 15(2): 269–293.
   Google Scholar
• Eppstein, D. (2005). The lattice dimension of a graph. Eur. J. Comb 26(5): 585–592.
   Web of Science ®Google Scholar
• Graham, R. L, Pollak, H. O. (1971). On the addressing problem for loop switching. The Bell Syst. Tech. J 50(88): 2495–2519.
   Google Scholar
• Imrich, W, Klavžar, S. (1993). A simple O(mn) algorithm for recognizing Hamming graphs. Bull. Inst. Comb. Appl 9: 45–56.
   Google Scholar
• Mulder, H. M. (2008). Transit functions on graphs (and posets)In: Changat, M., Klavžar, S., Mulder, H. M., Vijayakumar, A., eds. Convexity in Discrete Structures. Lecture Notes Series. Mysore: Ramanujan Math. Soc. pp. 117–130.
   Google Scholar
• Mulder, H. M, Nebeský, L. (2009). Axiomatic characterization of the interval function of a graph. Eur. J. Comb 30(5): 1172–1185.
   Web of Science ®Google Scholar
• Mulder, H. M. (1980). The Interval Function of a Graph. MC Tracts.
   Google Scholar
• Sheela, L. K., Changat, M, Peterin, I. (2023). Axiomatic characterization of the Toll Walk Function of some graph classes. In: Algorithms and Discrete Applied Mathematics: 9th International Conference, CALDAM 2023, Gandhinagar, India, February 9–11, 2023, Proceedings, pp. 427–446.
   Google Scholar
• Ovchinnikov, S. (2008). Partial cubes: structures, characterizations, and constructions. Discrete Math 308(23): 5597–5621.
   Web of Science ®Google Scholar
• Roth, R. I, Winkler, P. M. (1986). Collapse of the metric hierarchy for bipartite graphs. Eur. J. Comb 7(4): 371–375.
   Web of Science ®Google Scholar
• Polat, N. (2007). Netlike partial cubes I. General properties. Discr. Math 307(22): 2704–2722.
   Web of Science ®Google Scholar
• Wilkeit, E. (1990). Isometric embeddings in Hamming graphs. J. Combin. Theory, Series B 50(2): 179–197.
   Web of Science ®Google Scholar
• Winkler, P. M. (1984). Isometric embedding in product of complete graphs. Discrete Appl. Math 7(2): 221–225.
   Web of Science ®Google Scholar