{"created":"2023-05-15T12:06:30.596498+00:00","id":11356,"links":{},"metadata":{"_buckets":{"deposit":"59f8f50c-2dcf-48b8-a42d-ed5198c013e3"},"_deposit":{"created_by":3,"id":"11356","owners":[3],"pid":{"revision_id":0,"type":"depid","value":"11356"},"status":"published"},"_oai":{"id":"oai:iwate-u.repo.nii.ac.jp:00011356","sets":["1523:1528:1591:1603"]},"author_link":["81091","81090"],"item_41_alternative_title_23":{"attribute_name":"その他のタイトル","attribute_value_mlt":[{"subitem_alternative_title":"位相的離散幾何からみたあるクロー･フリーグラフのハミルトン性について"}]},"item_41_biblio_info_7":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2008-02-28","bibliographicIssueDateType":"Issued"},"bibliographicPageEnd":"52","bibliographicPageStart":"47","bibliographicVolumeNumber":"68","bibliographic_titles":[{"bibliographic_title":"岩手大学教育学部研究年報"}]}]},"item_41_date_6":{"attribute_name":"登録日","attribute_value_mlt":[{"subitem_date_issued_datetime":"2009-05-31"}]},"item_41_description_12":{"attribute_name":"Abstract","attribute_value_mlt":[{"subitem_description":"Let G be a connected claw-free simple graph with ","subitem_description_type":"Other"},{"subitem_description":"G","subitem_description_type":"Other"},{"subitem_description":" ≥ 3. We show that if the 2-dimensional simplicial complex △ (G) associated to G is simply connected then G is\\\nhamiltonian. A graph G is said to be △1-connected if every pair of edges are onnected\\\nby some chain consisting of edges and triangles. We also show that if G is △1-connected then G is hamiltonian.","subitem_description_type":"Other"}]},"item_41_full_name_3":{"attribute_name":"著者別名","attribute_value_mlt":[{"nameIdentifiers":[{}],"names":[{"name":"OSHIKIRI, Genichi"}]}]},"item_41_identifier_registration":{"attribute_name":"ID登録","attribute_value_mlt":[{"subitem_identifier_reg_text":"10.15113/00011350","subitem_identifier_reg_type":"JaLC"}]},"item_41_publisher_14":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"岩手大学教育学部"}]},"item_41_source_id_25":{"attribute_name":"NCID","attribute_value_mlt":[{"subitem_source_identifier":"AN00017940","subitem_source_identifier_type":"NCID"}]},"item_41_source_id_9":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"0367-7370","subitem_source_identifier_type":"ISSN"}]},"item_41_text_4":{"attribute_name":"著者(機関)","attribute_value_mlt":[{"subitem_text_value":"岩手大学教育学部数学教育"}]},"item_41_version_type_27":{"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":"押切, 源一"}],"nameIdentifiers":[{}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2016-11-14"}],"displaytype":"detail","filename":"arfe-v68p47-52.pdf","filesize":[{"value":"296.8 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"arfe-v68p47-52.pdf","url":"https://iwate-u.repo.nii.ac.jp/record/11356/files/arfe-v68p47-52.pdf"},"version_id":"ec3caf60-6f01-487e-a55d-18f2a9c6de6b"}]},"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":"Hamiltonian Property of Claw-free Graphs from the View Point of Topological Combinatorics","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Hamiltonian Property of Claw-free Graphs from the View Point of Topological Combinatorics"}]},"item_type_id":"41","owner":"3","path":["1603"],"pubdate":{"attribute_name":"公開日","attribute_value":"2009-05-31"},"publish_date":"2009-05-31","publish_status":"0","recid":"11356","relation_version_is_last":true,"title":["Hamiltonian Property of Claw-free Graphs from the View Point of Topological Combinatorics"],"weko_creator_id":"3","weko_shared_id":-1},"updated":"2023-05-16T07:53:01.986544+00:00"}