{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T11:01:30Z","timestamp":1725879690850},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319530062"},{"type":"electronic","value":"9783319530079"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-53007-9_9","type":"book-chapter","created":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T05:13:23Z","timestamp":1486012403000},"page":"96-106","source":"Crossref","is-referenced-by-count":2,"title":["Axiomatic Characterization of the Interval Function of a Bipartite Graph"],"prefix":"10.1007","author":[{"given":"Manoj","family":"Changat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ferdoos","family":"Hossein Nezhad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Narayanan","family":"Narayanan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,1,26]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","first-page":"885","DOI":"10.1016\/j.disc.2015.01.004","volume":"338","author":"K Balakrishnan","year":"2015","unstructured":"Balakrishnan, K., Changat, M., Lakshmikuttyamma, A.K., Mathews, J., Mulder, H.M., Narasimha-Shenoi, P.G., Narayanan, N.: Axiomatic characterization of the interval function of a block graph. Discret. Math. 338, 885\u2013894 (2015)","journal-title":"Discret. Math."},{"issue":"126","key":"9_CR2","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1023\/A:1013715518448","volume":"51","author":"M Changat","year":"2001","unstructured":"Changat, M., Klav\u017ear, S., Mulder, H.M.: The all-paths transit function of a graph. Czech. Math. J. 51(126), 439\u2013448 (2001)","journal-title":"Czech. Math. J."},{"issue":"3","key":"9_CR3","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/j.disc.2004.02.017","volume":"286","author":"M Changat","year":"2004","unstructured":"Changat, M., Mathew, J.: Induced path transit function, monotone and Peano axioms. Discret. Math. 286(3), 185\u2013194 (2004)","journal-title":"Discret. Math."},{"issue":"23","key":"9_CR4","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/j.disc.2003.07.014","volume":"290","author":"M Changat","year":"2005","unstructured":"Changat, M., Mulder, H.M., Sierksma, G.: Convexities related to path properties on graphs. Discret. Math. 290(23), 117\u2013131 (2005)","journal-title":"Discret. Math."},{"issue":"5","key":"9_CR5","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1016\/j.dam.2009.10.004","volume":"158","author":"M Changat","year":"2010","unstructured":"Changat, M., Mathews, J., Mulder, H.M.: The induced path function, monotonicity and betweenness. Discret. Appl. Math. 158(5), 426\u2013433 (2010)","journal-title":"Discret. Appl. Math."},{"key":"9_CR6","doi-asserted-by":"crossref","first-page":"951","DOI":"10.1016\/j.disc.2013.01.013","volume":"313","author":"M Changat","year":"2013","unstructured":"Changat, M., Lakshmikuttyamma, A.K., Mathews, J., Peterin, I., Narasimha- Shenoi, P.G., Seethakuttyamma, G., \u0160pacapan, S.: A forbiddensubgraph characterization of some graph classes using betweenness axioms. Discret. Math. 313, 951\u2013958 (2013)","journal-title":"Discret. Math."},{"key":"9_CR7","first-page":"1","volume":"39","author":"M Changat","year":"2015","unstructured":"Changat, M., Peterin, I., Ramachandran, A., Tepeh, A.: The induced path transit function and the Pasch axiom. Bull. Malays. Math. Sci. Soc. 39, 1\u201312 (2015)","journal-title":"Bull. Malays. Math. Sci. Soc."},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-319-29221-2_10","volume-title":"Algorithms and Discrete Applied Mathematics","author":"M Changat","year":"2016","unstructured":"Changat, M., Hossein Nezhad, F., Narayanan, N.: Axiomatic characterization of claw and paw-free graphs using graph transit functions. In: Govindarajan, S., Maheshwari, A. (eds.) CALDAM 2016. LNCS, vol. 9602, pp. 115\u2013125. Springer, Heidelberg (2016). doi: 10.1007\/978-3-319-29221-2_10"},{"key":"9_CR9","unstructured":"Changat, M., Hossein Nezhad, F., Mulder, H.M., Narayanan, N.: A note on the interval function of a disconnected graph, Discussiones Mathematicae Graph Theory (2016, accepted)"},{"issue":"20","key":"9_CR10","doi-asserted-by":"crossref","first-page":"2143","DOI":"10.1016\/j.disc.2011.06.011","volume":"311","author":"V Chv\u00e1tal","year":"2011","unstructured":"Chv\u00e1tal, V., Rautenbach, D., Sch\u00e4fer, P.M.: Finite sholander trees, trees, and their betweenness. Discret. Math. 311(20), 2143\u20132147 (2011)","journal-title":"Discret. Math."},{"key":"9_CR11","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0095-8956(88)90039-1","volume":"44","author":"P Duchet","year":"1988","unstructured":"Duchet, P.: Convex sets in graphs II minimal path convexity. J. Combin. Theory Ser. B 44, 307\u2013316 (1988)","journal-title":"J. Combin. Theory Ser. B"},{"key":"9_CR12","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/S0012-365X(01)00296-5","volume":"254","author":"MA Morgana","year":"2002","unstructured":"Morgana, M.A., Mulder, H.M.: The induced path convexity, betweenness and svelte graphs. Discret. Math. 254, 349\u2013370 (2002)","journal-title":"Discret. Math."},{"key":"9_CR13","first-page":"1","volume":"132","author":"HM Mulder","year":"1980","unstructured":"Mulder, H.M.: The interval function of a graph. MC Tract 132, 1\u2013191 (1980). Mathematisch Centrum, Amsterdam","journal-title":"MC Tract"},{"key":"9_CR14","series-title":"Lecture Notes Series","first-page":"117","volume-title":"Convexity in Discrete Structures","author":"HM Mulder","year":"2008","unstructured":"Mulder, H.M.: Transit functions on graphs (and posets). In: Changat, M., Klav\u017ear, S., Mulder, H.M., Vijayakumar, A. (eds.) Convexity in Discrete Structures. Lecture Notes Series, pp. 117\u2013130. Ramanujan Mathematical Society, Mysore (2008)"},{"key":"9_CR15","doi-asserted-by":"crossref","first-page":"1172","DOI":"10.1016\/j.ejc.2008.09.007","volume":"30","author":"HM Mulder","year":"2009","unstructured":"Mulder, H.M., Nebesk\u00fd, L.: Axiomatic characterization of the interval function of a graph. Eur. J. Combin. 30, 1172\u20131185 (2009)","journal-title":"Eur. J. Combin."},{"key":"9_CR16","doi-asserted-by":"crossref","first-page":"173","DOI":"10.21136\/CMJ.1994.128449","volume":"44","author":"L Nebesk\u00fd","year":"1994","unstructured":"Nebesk\u00fd, L.: A characterization of the interval function of a connected graph. Czech. Math. J. 44, 173\u2013178 (1994)","journal-title":"Czech. Math. J."},{"issue":"2","key":"9_CR17","doi-asserted-by":"crossref","first-page":"137","DOI":"10.21136\/MB.1998.126307","volume":"123","author":"L Nebesk\u00fd","year":"1998","unstructured":"Nebesk\u00fd, L.: Characterizing the interval function of a connected graph. Math. Bohem. 123(2), 137\u2013144 (1998)","journal-title":"Math. Bohem."},{"key":"9_CR18","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1023\/A:1013744324808","volume":"51","author":"L Nebesk\u00fd","year":"2001","unstructured":"Nebesk\u00fd, L.: Characterization of the interval function of a (finite or infinite) connected graph. Czech. Math. J. 51, 635\u2013642 (2001)","journal-title":"Czech. Math. J."},{"key":"9_CR19","doi-asserted-by":"crossref","first-page":"397","DOI":"10.21136\/MB.2002.134072","volume":"127","author":"L Nebesk\u00fd","year":"2002","unstructured":"Nebesk\u00fd, L.: The induced paths in a connected graph and a ternary relation determined by them. Math. Bohem. 127, 397\u2013408 (2002)","journal-title":"Math. Bohem."},{"issue":"3","key":"9_CR20","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1090\/S0002-9939-1952-0048405-5","volume":"3","author":"M Sholander","year":"1952","unstructured":"Sholander, M.: Trees, lattices, order, and betweenness. Proc. Am. Math. Soc. 3(3), 369\u2013381 (1952)","journal-title":"Proc. Am. Math. Soc."},{"issue":"5","key":"9_CR21","doi-asserted-by":"crossref","first-page":"801","DOI":"10.1090\/S0002-9939-1954-0064749-7","volume":"5","author":"M Sholander","year":"1954","unstructured":"Sholander, M.: Medians and betweenness. Proc. Am. Math. Soc. 5(5), 801\u2013807 (1954)","journal-title":"Proc. Am. Math. Soc."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-53007-9_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T08:57:54Z","timestamp":1601542674000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-53007-9_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319530062","9783319530079"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-53007-9_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}