{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,26]],"date-time":"2026-06-26T22:40:31Z","timestamp":1782513631994,"version":"3.54.5"},"reference-count":29,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2010,3,1]],"date-time":"2010-03-01T00:00:00Z","timestamp":1267401600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2014,3,6]],"date-time":"2014-03-06T00:00:00Z","timestamp":1394064000000},"content-version":"vor","delay-in-days":1466,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2010,3]]},"DOI":"10.1016\/j.dam.2009.10.004","type":"journal-article","created":{"date-parts":[[2009,11,13]],"date-time":"2009-11-13T09:49:02Z","timestamp":1258105742000},"page":"426-433","source":"Crossref","is-referenced-by-count":27,"title":["The induced path function, monotonicity and betweenness"],"prefix":"10.1016","volume":"158","author":[{"given":"Manoj","family":"Changat","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Joseph","family":"Mathew","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Henry Martyn","family":"Mulder","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2009.10.004_b1","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1112\/jlms\/s2-3.3.422","article-title":"Some elementary properties of interval convexities","volume":"3","author":"Calder","year":"1971","journal-title":"J. London Math. Soc."},{"issue":"126","key":"10.1016\/j.dam.2009.10.004_b2","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1023\/A:1013715518448","article-title":"The all-paths transit function of a graph","volume":"51","author":"Changat","year":"2001","journal-title":"Czechoslovak Math. J."},{"key":"10.1016\/j.dam.2009.10.004_b3","series-title":"Proceedings of the Conference on Graph Connections","first-page":"87","article-title":"Interval monotone graphs: Minimal path convexity","author":"Changat","year":"1999"},{"key":"10.1016\/j.dam.2009.10.004_b4","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/j.disc.2004.02.017","article-title":"Induced path transit function, monotone and Peano axioms","volume":"286","author":"Changat","year":"2004","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2009.10.004_b5","series-title":"Convexity in Discrete Structures","first-page":"47","article-title":"A characterization of J-monotone graphs","volume":"vol. 5","author":"Changat","year":"2008"},{"key":"10.1016\/j.dam.2009.10.004_b6","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/j.disc.2003.07.014","article-title":"Convexities related to path properties on graphs","volume":"290","author":"Changat","year":"2005","journal-title":"Discrete Math."},{"issue":"1","key":"10.1016\/j.dam.2009.10.004_b7","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1137\/S0895480195321718","article-title":"Convexity and HHD-free graphs","volume":"12","author":"Dragan","year":"1999","journal-title":"SIAM. J. Discrete Math."},{"key":"10.1016\/j.dam.2009.10.004_b8","first-page":"261","article-title":"Convexity in combinatorial structures","volume":"14","author":"Duchet","year":"1987","journal-title":"Rend. Circ. Mat. Palermo (2) Suppl."},{"key":"10.1016\/j.dam.2009.10.004_b9","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0095-8956(88)90039-1","article-title":"Convex sets in graphs II. Minimal path convexity","volume":"44","author":"Duchet","year":"1988","journal-title":"J. Combin. Theory Ser. B."},{"key":"10.1016\/j.dam.2009.10.004_b10","series-title":"Proceedings of the Conference on Graph Connections","first-page":"10","article-title":"Discrete convexity: Retractions, morphisms and partition problem","author":"Duchet","year":"1999"},{"key":"10.1016\/j.dam.2009.10.004_b11","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1137\/0607049","article-title":"Convexity in graphs and hypergraphs","volume":"7","author":"Farber","year":"1986","journal-title":"SIAM J. Algebr. Discrete Methods"},{"key":"10.1016\/j.dam.2009.10.004_b12","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1016\/0196-8858(88)90019-X","article-title":"On the semi-perfect elimination","volume":"9","author":"Jamison","year":"1988","journal-title":"Adv. Appl. Math."},{"key":"10.1016\/j.dam.2009.10.004_b13","unstructured":"R.E. Jamison-Waldner, A perspective on abstract convexity: Classifying alignments by varieties, in: D.C. Kay and M. Breen (Eds.), Convexity and Related Combinatorial Geometry. Proceedings of 2nd Oklahoma Conf., New York, 1982, pp. 113\u2013150"},{"key":"10.1016\/j.dam.2009.10.004_b14","first-page":"103","article-title":"Median graphs: Characterizations, location theory and related structures","volume":"30","author":"Klav\u017ear","year":"1999","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"10.1016\/j.dam.2009.10.004_b15","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/0012-365X(93)90064-Z","article-title":"Interval-regularity does not lead to interval monotonocity","volume":"118","author":"Mollard","year":"1993","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2009.10.004_b16","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/S0012-365X(01)00296-5","article-title":"The induced path convexity, betweenness and svelte graphs","volume":"254","author":"Morgana","year":"2002","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2009.10.004_b17","series-title":"The Interval Function of a Graph","volume":"vol. 132","author":"Mulder","year":"1980"},{"key":"10.1016\/j.dam.2009.10.004_b18","series-title":"Convexity in Discrete Structures","first-page":"117","article-title":"Transit functions on graphs (and posets)","volume":"vol. 5","author":"Mulder","year":"2008"},{"key":"10.1016\/j.dam.2009.10.004_b19","doi-asserted-by":"crossref","first-page":"1172","DOI":"10.1016\/j.ejc.2008.09.007","article-title":"Axiomatic characterization of the interval function","volume":"30","author":"Mulder","year":"2009","journal-title":"European J. Combin."},{"key":"10.1016\/j.dam.2009.10.004_b20","doi-asserted-by":"crossref","first-page":"173","DOI":"10.21136\/CMJ.1994.128449","article-title":"Characterization of the interval function of a connected graph","volume":"44","author":"Nebesk\u00fd","year":"1994","journal-title":"Czechoslovak Math. J."},{"key":"10.1016\/j.dam.2009.10.004_b21","doi-asserted-by":"crossref","first-page":"137","DOI":"10.21136\/MB.1998.126307","article-title":"Characterizing the interval function of a connected graph","volume":"123","author":"Nebesk\u00fd","year":"1998","journal-title":"Math. Bohemica."},{"key":"10.1016\/j.dam.2009.10.004_b22","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1023\/A:1013744324808","article-title":"Characterization of the interval function of a (finite or infinite) connected graph","volume":"51","author":"Nebesk\u00fd","year":"2001","journal-title":"Czechoslovak Math. J."},{"key":"10.1016\/j.dam.2009.10.004_b23","doi-asserted-by":"crossref","first-page":"397","DOI":"10.21136\/MB.2002.134072","article-title":"The induced paths in a connected graph and a ternary relation determined by them","volume":"127","author":"Nebesk\u00fd","year":"2002","journal-title":"Math. Bohemica."},{"key":"10.1016\/j.dam.2009.10.004_b24","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0012-365X(94)00178-L","article-title":"A remark of Mulder\u2019s conjucture about interval regular graphs","volume":"147","author":"Nomora","year":"1995","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2009.10.004_b25","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1137\/0205021","article-title":"Algorithmic aspects on vertex elimination on graphs","volume":"5","author":"Rose","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.dam.2009.10.004_b26","first-page":"1065","article-title":"Convex sets in graphs","volume":"15","author":"Sampathkumar","year":"1984","journal-title":"Indian J. Pure Appl. Math."},{"key":"10.1016\/j.dam.2009.10.004_b27","unstructured":"E. Sampathkumar, B-Systems, in: S. Amaguram, B.D. Acharya, and E. Sampathkumar (Eds.), Graph Theory and its Applications, Proceedings of the National Workshop, Manonmaniam Sundaranar University, Tirunelbeli, 1996, pp. 173\u2013185"},{"key":"10.1016\/j.dam.2009.10.004_b28","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1137\/0213035","article-title":"Simple linear time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce a cyclic hypergraphs","volume":"3","author":"Tarjan","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.dam.2009.10.004_b29","series-title":"Theory of Convex Structures","author":"van de Vel","year":"1993"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X09003916?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X09003916?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,10,14]],"date-time":"2021-10-14T01:00:18Z","timestamp":1634173218000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X09003916"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3]]},"references-count":29,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2010,3]]}},"alternative-id":["S0166218X09003916"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2009.10.004","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2010,3]]}}}