{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T03:36:01Z","timestamp":1648611361320},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2019,9,14]],"date-time":"2019-09-14T00:00:00Z","timestamp":1568419200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,9,14]],"date-time":"2019-09-14T00:00:00Z","timestamp":1568419200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2019,11]]},"DOI":"10.1007\/s00373-019-02099-y","type":"journal-article","created":{"date-parts":[[2019,9,14]],"date-time":"2019-09-14T16:02:41Z","timestamp":1568476961000},"page":"1647-1657","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the Maximum Diameter of Path-Pairable Graphs"],"prefix":"10.1007","volume":"35","author":[{"given":"Ant\u00f3nio","family":"Gir\u00e3o","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kamil","family":"Popielarz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G\u00e1bor","family":"M\u00e9sz\u00e1ros","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Richard","family":"Snyder","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,9,14]]},"reference":[{"issue":"3","key":"2099_CR1","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/BF01261316","volume":"16","author":"B Bollob\u00e1s","year":"1996","unstructured":"Bollob\u00e1s, B., Thomason, A.: Highly linked graphs. Combinatorica 16(3), 313\u2013320 (1996)","journal-title":"Combinatorica"},{"key":"2099_CR2","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1002\/net.3230220702","volume":"22","author":"L Csaba","year":"1992","unstructured":"Csaba, L., Faudree, R., Gy\u00e1rf\u00e1s, A., Lehel, J., Schelp, R.: Networks communicating for each pairing of terminals. Networks 22, 615\u2013626 (1992)","journal-title":"Networks"},{"key":"2099_CR3","first-page":"111","volume":"88","author":"R Faudree","year":"1992","unstructured":"Faudree, R., Gy\u00e1rf\u00e1s, A., Lehel, J.: Minimal path pairable graphs. Congressus Numer. 88, 111\u2013128 (1992)","journal-title":"Congressus Numer."},{"key":"2099_CR4","first-page":"91","volume":"21","author":"RJ Faudree","year":"1992","unstructured":"Faudree, R.J.: Properties in path-pairable graphs. N Z J. Math. 21, 91\u2013106 (1992)","journal-title":"N Z J. Math."},{"key":"2099_CR5","first-page":"145","volume":"20","author":"RJ Faudree","year":"1999","unstructured":"Faudree, R.J., Gy\u00e1rf\u00e1s, A., Lehel, J.: Path-pairable graphs. J. Combin. Math. Combin. Comput. 20, 145\u2013157 (1999)","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"2099_CR6","doi-asserted-by":"crossref","first-page":"2","DOI":"10.37236\/7291","volume":"26","author":"A Gir\u00e3o","year":"2019","unstructured":"Gir\u00e3o, A., M\u00e9sz\u00e1ros, G., Popielarz, K., Snyder, R.: On the maximum degree of path-pairable planar graphs. Electron. J. Combin. 26, 2 (2019)","journal-title":"Electron. J. Combin."},{"key":"2099_CR7","unstructured":"Gy\u0151ri, E., Mezei, T.\u00a0R., M\u00e9sz\u00e1ros, G.: Note on terminal-pairability in complete grid graphs. Discret. Math. (appearing)"},{"key":"2099_CR8","first-page":"577","volume":"1","author":"E Kubicka","year":"1999","unstructured":"Kubicka, E., Kubicki, G., Lehel, J.: Path-pairable property for complete grids. Combin. Graph Theory Algorithms 1, 577\u2013586 (1999)","journal-title":"Combin. Graph Theory Algorithms"},{"key":"2099_CR9","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.disc.2014.08.011","volume":"337","author":"G M\u00e9sz\u00e1ros","year":"2014","unstructured":"M\u00e9sz\u00e1ros, G.: Note on the diameter of path-pairable graphs. Discret. Math. 337, 83\u201386 (2014)","journal-title":"Discret. Math."},{"key":"2099_CR10","doi-asserted-by":"publisher","first-page":"743","DOI":"10.7151\/dmgt.1888","volume":"36","author":"G M\u00e9sz\u00e1ros","year":"2016","unstructured":"M\u00e9sz\u00e1ros, G.: On path-pairability in the cartesian product of graphs. Discuss. Math. Graph Theory 36, 743\u2013758 (2016)","journal-title":"Discuss. Math. Graph Theory"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-019-02099-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-019-02099-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-019-02099-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,14]],"date-time":"2020-09-14T09:34:46Z","timestamp":1600076086000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-019-02099-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,14]]},"references-count":10,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2019,11]]}},"alternative-id":["2099"],"URL":"https:\/\/doi.org\/10.1007\/s00373-019-02099-y","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,9,14]]},"assertion":[{"value":"30 July 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 September 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 September 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}