{"created":"2021-03-01T06:40:08.574961+00:00","id":34810,"links":{},"metadata":{"_buckets":{"deposit":"84b3826c-8e0e-4c2d-8f00-f8aae08b50cc"},"_deposit":{"id":"34810","owners":[],"pid":{"revision_id":0,"type":"depid","value":"34810"},"status":"published"},"_oai":{"id":"oai:teapot.lib.ocha.ac.jp:00034810","sets":["347:359:635"]},"item_11_biblio_info_8":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"1980-12","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"2","bibliographicPageEnd":"80","bibliographicPageStart":"75","bibliographicVolumeNumber":"31","bibliographic_titles":[{"bibliographic_title":"お茶の水女子大學自然科學報告"}]}]},"item_11_description_17":{"attribute_name":"フォーマット","attribute_value_mlt":[{"subitem_description":"application/pdf","subitem_description_type":"Other"}]},"item_11_description_46":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"subitem_description":"紀要論文","subitem_description_type":"Other"}]},"item_11_description_7":{"attribute_name":"内容記述","attribute_value_mlt":[{"subitem_description":"A graph G=(V, E) is called a complete semi-bigraph and denoted by K'(l, m) if the vertex set can be partitioned into two subsets V_1(|V_1|=l) and V_2(|V_2|=m) such that [u, v]∉E for every u, v∈V_1(u≠v), and [v_1, v_2]∈E for every v_1∈V_1 and v_2∈V_2. THEOREM. Let G=(V, E) be an undirected 2-connected graph with n≧3 vertices and satisfying the following: [u, v]∉E⇒d(u)+d(v)≧n-1. Then G is either hamiltonian or a complete semi-bigraph K'(n+1/2, n-1/2). In particular, if n is even, then G must be hamiltonian.","subitem_description_type":"Other"}]},"item_11_full_name_2":{"attribute_name":"著者(ヨミ)","attribute_value_mlt":[{"nameIdentifiers":[{"nameIdentifier":"70196","nameIdentifierScheme":"WEKO"}],"names":[{"name":"ナラ, チエ"}]}]},"item_11_publisher_36":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"お茶の水女子大学"}]},"item_11_source_id_11":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00033958","subitem_source_identifier_type":"NCID"}]},"item_11_source_id_9":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"00298190","subitem_source_identifier_type":"ISSN"}]},"item_11_subject_20":{"attribute_name":"日本十進分類法","attribute_value_mlt":[{"subitem_subject":"400","subitem_subject_scheme":"NDC"}]},"item_11_text_18":{"attribute_name":"形態","attribute_value_mlt":[{"subitem_text_value":"317997 bytes"}]},"item_11_text_47":{"attribute_name":"資源タイプ・ローカル","attribute_value_mlt":[{"subitem_text_value":"紀要論文"}]},"item_11_text_48":{"attribute_name":"資源タイプ・NII","attribute_value_mlt":[{"subitem_text_value":"Departmental Bulletin Paper"}]},"item_11_text_49":{"attribute_name":"資源タイプ・DCMI","attribute_value_mlt":[{"subitem_text_value":"text"}]},"item_11_text_50":{"attribute_name":"資源タイプ・ローカル表示コード","attribute_value_mlt":[{"subitem_text_value":"03"}]},"item_11_text_79":{"attribute_name":"所属","attribute_value_mlt":[{"subitem_text_value":"The Doctoral Research Course in Human Culture, Ochanomizu University"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Nara, Chie"}],"nameIdentifiers":[{"nameIdentifier":"70195","nameIdentifierScheme":"WEKO"}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2018-04-19"}],"displaytype":"detail","filename":"KJ00004829970.pdf","filesize":[{"value":"318.0 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"KJ00004829970.pdf","url":"https://teapot.lib.ocha.ac.jp/record/34810/files/KJ00004829970.pdf"},"version_id":"5457bf19-e88c-4f79-a6e6-370b342a7535"}]},"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":"On Sufficient Conditions for a Graph to be Hamiltonian","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"On Sufficient Conditions for a Graph to be Hamiltonian"}]},"item_type_id":"11","owner":"1","path":["635"],"pubdate":{"attribute_name":"公開日","attribute_value":"2008-04-30"},"publish_date":"2008-04-30","publish_status":"0","recid":"34810","relation_version_is_last":true,"title":["On Sufficient Conditions for a Graph to be Hamiltonian"],"weko_creator_id":"1","weko_shared_id":null},"updated":"2022-12-12T05:39:22.716747+00:00"}