{"created":"2023-06-20T15:10:32.875595+00:00","id":6751,"links":{},"metadata":{"_buckets":{"deposit":"2907b112-7da6-477b-8292-a773b863709a"},"_deposit":{"created_by":3,"id":"6751","owners":[3],"pid":{"revision_id":0,"type":"depid","value":"6751"},"status":"published"},"_oai":{"id":"oai:ynu.repo.nii.ac.jp:00006751","sets":["616:627:651"]},"author_link":["29626"],"item_6_biblio_info_8":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"1985","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1&2","bibliographicPageEnd":"91","bibliographicPageStart":"67","bibliographicVolumeNumber":"33","bibliographic_titles":[{"bibliographic_title":"Yokohama Mathematical Journal = 横濱市立大學紀要. D部門, 数学"}]}]},"item_6_description_17":{"attribute_name":"フォーマット","attribute_value_mlt":[{"subitem_description":"application/pdf","subitem_description_type":"Other"}]},"item_6_description_5":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"A graph ＄G＄ is said to be uniquely embeddable in a surface ＄F^{2}＄ if for any two embeddings ＄f_{1},f_{2}＄ : ＄G￥rightarrow F^{2}＄, there is an automorphism ＄￥sigma＄ : ＄G￥rightarrow G＄ and a homeomorphism ＄h;F^{2}￥rightarrow F^{2}＄ such that ＄ h_{￥circ}f_{1}=f_{2}￥circ￥sigma＄ . A graph ＄G＄ is said to be faithfully embeddable in a surface ＄F^{2}＄ if ＄G＄ admits an embedding ＄f:G￥rightarrow F^{2}＄ such that for any automorphism ＄￥sigma:G￥rightarrow G＄ , there is a homeomorphism ＄h＄ ; ＄F^{2}￥rightarrow F^{2}＄ with ＄ h_{0}f=f￥circ￥sigma＄ . Given a hyperbolic closed surface ＄F^{2}＄, an infinite number of 6-connected graphs which are not uniquely or not faithfully embeddable in ＄F^{2}＄ will be constructed systematically.","subitem_description_type":"Abstract"}]},"item_6_publisher_35":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"Yokohama City University"}]},"item_6_source_id_11":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA0089285X","subitem_source_identifier_type":"NCID"}]},"item_6_source_id_9":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"00440523","subitem_source_identifier_type":"ISSN"}]},"item_6_text_4":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"Department of Information Science, Tokyo Institute of Technology, Oh-okayama, Meguro-ku, Tokyo 152, Japan"}]},"item_6_version_type_18":{"attribute_name":"著者版フラグ","attribute_value_mlt":[{"subitem_version_resource":"http://purl.org/coar/version/c_970fb48d4fbd8a85","subitem_version_type":"VoR"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Negami, Seiya"}],"nameIdentifiers":[{"nameIdentifier":"29626","nameIdentifierScheme":"WEKO"}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2016-09-26"}],"displaytype":"detail","filename":"YMJ_33_N1-2_1985_067-091.pdf","filesize":[{"value":"2.8 MB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"YMJ_33_N1-2_1985_067-091.pdf","url":"https://ynu.repo.nii.ac.jp/record/6751/files/YMJ_33_N1-2_1985_067-091.pdf"},"version_id":"ae8fc37a-defa-47b3-8544-a2d6e7c1cd9a"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"departmental bulletin paper","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_title":"CONSTRUCTION OF GRAPHS WHICH ARE NOT UNIQUELY AND NOT FAITHFULLY EMBEDDABLE IN SURFACES","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"CONSTRUCTION OF GRAPHS WHICH ARE NOT UNIQUELY AND NOT FAITHFULLY EMBEDDABLE IN SURFACES"}]},"item_type_id":"6","owner":"3","path":["651"],"pubdate":{"attribute_name":"公開日","attribute_value":"2009-12-15"},"publish_date":"2009-12-15","publish_status":"0","recid":"6751","relation_version_is_last":true,"title":["CONSTRUCTION OF GRAPHS WHICH ARE NOT UNIQUELY AND NOT FAITHFULLY EMBEDDABLE IN SURFACES"],"weko_creator_id":"3","weko_shared_id":3},"updated":"2023-06-20T18:48:16.030318+00:00"}