{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:59:55Z","timestamp":1725494395176},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540423065"},{"type":"electronic","value":"9783540477389"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-47738-1_15","type":"book-chapter","created":{"date-parts":[[2007,11,6]],"date-time":"2007-11-06T22:52:49Z","timestamp":1194389569000},"page":"167-175","source":"Crossref","is-referenced-by-count":0,"title":["On double bound graphs with respect to graph operations"],"prefix":"10.1007","author":[{"given":"Shin-ich","family":"Iwai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kenjiro","family":"Ogawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Morimasa","family":"Tsuchiya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,9,20]]},"reference":[{"key":"15_CR1","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1017\/S0013091500011421","volume":"15","author":"M. Behzad","year":"1966","unstructured":"M. Behzad and G. Chartrand, Total graphs and traversability, Proc. Edinburgh Math. Soc., 15 (1966)117\u2013120.","journal-title":"Proc. Edinburgh Math. Soc."},{"key":"15_CR2","first-page":"52","volume":"10","author":"D. Diny","year":"1985","unstructured":"D. Diny, The double bound graph of a partially ordered set, Journal of Combinatorics, Infomation & System Sciences, 10(1985),52\u201356.","journal-title":"Journal of Combinatorics, Infomation & System Sciences"},{"key":"15_CR3","unstructured":"H. Era, K. Ogawa, and M. Tsuchiya, On upper bound graphs with respect to unary operations on graphs, (preprint)."},{"issue":"2","key":"15_CR4","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/S0304-3975(99)00194-2","volume":"235","author":"H. Era","year":"2000","unstructured":"H. Era, K. Ogawa, and M. Tsuchiya, On upper bound graphs with respect to operations on graphs, Theoretical Computer Science, 235(2)(2000),219\u2013223.","journal-title":"Theoretical Computer Science"},{"key":"15_CR5","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/S0012-365X(97)00048-4","volume":"197","author":"H. Era","year":"1998","unstructured":"H. Era and M. Tsuchiya, On upper bound graphs whose complements are also upper bound graphs, Discrete Mathematics, 197(1998),103\u2013109.","journal-title":"Discrete Mathematics"},{"key":"15_CR6","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/0012-365X(76)90037-6","volume":"14","author":"T. Hamada","year":"1976","unstructured":"T. Hamada and I. Yoshimura, Traversability and connectivity of the middle graph of a graph, Discrete Mathematics, 14(1976)247\u2013255.","journal-title":"Discrete Mathematics"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"F. Harary, Graph Theory, (Addison-Wesley, 1969).","DOI":"10.21236\/AD0705364"},{"key":"15_CR8","unstructured":"S.-I. Iwai, K. Ogawa and M. Tsuchiya, A note on construction of double bound graphs, (preprint)."},{"key":"15_CR9","first-page":"134","volume":"7","author":"F.R. McMorris","year":"1982","unstructured":"F.R. McMorris and T. Zaslavsky, Bound graphs of a partially ordered set, Journal of Combinatorics, Infomation & System Sciences, 7(1982),134\u2013138.","journal-title":"Journal of Combinatorics, Infomation & System Sciences"},{"key":"15_CR10","first-page":"265","volume":"23","author":"K. Ogawa","year":"1999","unstructured":"K. Ogawa and M. Tsuchiya, On upper bound graphs with respect to line graphs, Southeast Asian Bulletin of Mathematics, 23(1999),265\u2013269.","journal-title":"Southeast Asian Bulletin of Mathematics"}],"container-title":["Lecture Notes in Computer Science","Discrete and Computational Geometry"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-47738-1_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T02:06:57Z","timestamp":1551060417000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-47738-1_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540423065","9783540477389"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-47738-1_15","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}