{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:55:42Z","timestamp":1725512142627},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540706656"},{"type":"electronic","value":"9783540706663"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70666-3_7","type":"book-chapter","created":{"date-parts":[[2007,6,26]],"date-time":"2007-06-26T00:16:03Z","timestamp":1182816963000},"page":"59-69","source":"Crossref","is-referenced-by-count":0,"title":["Impossibility of Transformation of Vertex Labeled Simple Graphs Preserving the Cut-Size Order"],"prefix":"10.1007","author":[{"given":"Hiro","family":"Ito","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1137\/0110037","volume":"10","author":"S.L. Hakimi","year":"1962","unstructured":"Hakimi, S.L.: On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I. J. Soc. Indust. Appl. Math.\u00a010, 496\u2013506 (1962)","journal-title":"I. J. Soc. Indust. Appl. Math."},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1137\/0111010","volume":"11","author":"S.L. Hakimi","year":"1963","unstructured":"Hakimi, S.L.: On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph II. J. Soc. Indust. Appl. Math.\u00a011, 135\u2013147 (1963)","journal-title":"J. Soc. Indust. Appl. Math."},{"key":"7_CR3","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/S0925-7721(02)00048-2","volume":"24","author":"H. Ito","year":"2003","unstructured":"Ito, H.: Sum of Edge Lengths of a Multigraph Drawn on a Convex Polygon. Comput. Geom.\u00a024, 41\u201347 (2003)","journal-title":"Comput. Geom."},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/11589440_13","volume-title":"Discrete and Computational Geometry","author":"H. Ito","year":"2005","unstructured":"Ito, H.: Three Equivalent Partial Orders on Graphs with Real Edge-Weights Drawn on a Convex Polygon. In: Akiyama, J., Kano, M., Tan, X. (eds.) Discrete and Computational Geometry. Japanese Conference, JCDCG 2004, Tokyo, Japan, October 8-11, 2004. LNCS, vol.\u00a03742, pp. 123\u2013130. Springer, Heidelberg (2005)"},{"key":"7_CR5","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0020-0190(89)90012-4","volume":"32","author":"S.S. Skiena","year":"1989","unstructured":"Skiena, S.S.: Reconstructing Graphs from Cut-Set Sizes. Inform. Process. Lett.\u00a032, 123\u2013127 (1989)","journal-title":"Inform. Process. Lett."},{"key":"7_CR6","volume-title":"Introduction to Graph Theory","author":"D.B. West","year":"1996","unstructured":"West, D.B.: Introduction to Graph Theory. Prentice Hall, Upper Saddle River (1996)"}],"container-title":["Lecture Notes in Computer Science","Discrete Geometry, Combinatorics and Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70666-3_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:09:30Z","timestamp":1605762570000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70666-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540706656","9783540706663"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70666-3_7","relation":{},"subject":[]}}