WEKO3
アイテム
{"_buckets": {"deposit": "f32d3d27-22b1-419f-a581-7b1c629e90a0"}, "_deposit": {"created_by": 3, "id": "11354", "owners": [3], "pid": {"revision_id": 0, "type": "depid", "value": "11354"}, "status": "published"}, "_oai": {"id": "oai:ynu.repo.nii.ac.jp:00011354", "sets": ["501"]}, "author_link": ["39962", "39945", "39964", "39963"], "item_2_biblio_info_8": {"attribute_name": "書誌情報", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2021-06-12", "bibliographicIssueDateType": "Issued"}, "bibliographic_titles": [{"bibliographic_title": "Graphs and combinatorics"}]}]}, "item_2_description_5": {"attribute_name": "抄録", "attribute_value_mlt": [{"subitem_description": "We consider a proper coloring of a plane graph such that no face is rainbow, where a face is rainbow if any two vertices on its boundary have distinct colors. Such a coloring is said to be proper anti-rainbow. A plane quadrangulation G is a plane graph in which all faces are bounded by a cycle of length 4. In this paper, we show that the number of colors in a proper anti-rainbow coloring of a plane quadrangulation G does not exceed 3α(G)/2, where α(G) is the independence number of G. Moreover, if the minimum degree of G is 3 or if G is 3-connected, then this bound can be improved to 5α(G)/4 or 7α(G)/6+1/3, respectively. All of these bounds are tight.", "subitem_description_type": "Abstract"}]}, "item_2_description_6": {"attribute_name": "内容記述", "attribute_value_mlt": [{"subitem_description": "This is a post-peer-review, pre-copyedit version of an article published in Graphs and Combinatorics. The final authenticated version is available online at: http://dx.doi.org/10.1007/s00373-021-02350-5", "subitem_description_type": "Other"}]}, "item_2_full_name_3": {"attribute_name": "著者別名", "attribute_value_mlt": [{"nameIdentifiers": [{"nameIdentifier": "39964", "nameIdentifierScheme": "WEKO"}], "names": [{"name": "College, of Engineering Science Yokohama National University"}]}]}, "item_2_publisher_35": {"attribute_name": "出版者", "attribute_value_mlt": [{"subitem_publisher": "Springer"}]}, "item_2_relation_13": {"attribute_name": "DOI", "attribute_value_mlt": [{"subitem_relation_type": "isVersionOf", "subitem_relation_type_id": {"subitem_relation_type_id_text": "info:doi/10.1007/s00373-021-02350-5", "subitem_relation_type_select": "DOI"}}]}, "item_2_relation_44": {"attribute_name": "関係URI", "attribute_value_mlt": [{"subitem_relation_name": [{"subitem_relation_name_text": "https://doi.org/10.1007/s00373-021-02350-5"}], "subitem_relation_type_id": {"subitem_relation_type_id_text": "https://doi.org/10.1007/s00373-021-02350-5", "subitem_relation_type_select": "DOI"}}]}, "item_2_source_id_11": {"attribute_name": "書誌レコードID", "attribute_value_mlt": [{"subitem_source_identifier": "AA11623984", "subitem_source_identifier_type": "NCID"}]}, "item_2_source_id_9": {"attribute_name": "ISSN", "attribute_value_mlt": [{"subitem_source_identifier": "14355914", "subitem_source_identifier_type": "ISSN"}]}, "item_2_text_4": {"attribute_name": "著者所属", "attribute_value_mlt": [{"subitem_text_value": "Department of Computer and Information Science, Faculty of Science and Technology, Seikei University"}, {"subitem_text_value": "Faculty of Environment and Information Sciences, Yokohama National University"}]}, "item_2_version_type_18": {"attribute_name": "著者版フラグ", "attribute_value_mlt": [{"subitem_version_resource": "http://purl.org/coar/version/c_ab4af688f83e57aa", "subitem_version_type": "AM"}]}, "item_creator": {"attribute_name": "著者", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "Enami, Kengo"}], "nameIdentifiers": [{"nameIdentifier": "39962", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Ozeki, Kenta"}], "nameIdentifiers": [{"nameIdentifier": "39945", "nameIdentifierScheme": "WEKO"}, {"nameIdentifier": "10649122", "nameIdentifierScheme": "e-Rad", "nameIdentifierURI": "https://kaken.nii.ac.jp/ja/search/?qm=10649122"}]}, {"creatorNames": [{"creatorName": "Yamaguchi, Tomoki"}], "nameIdentifiers": [{"nameIdentifier": "39963", "nameIdentifierScheme": "WEKO"}]}]}, "item_files": {"attribute_name": "ファイル情報", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2021-07-16"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "dividing_system_2021_0522.pdf", "filesize": [{"value": "203.9 kB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 203900.0, "url": {"label": "dividing_system_2021_0522.pdf", "url": "https://ynu.repo.nii.ac.jp/record/11354/files/dividing_system_2021_0522.pdf"}, "version_id": "801ca427-6fe4-4e04-b0df-d7a4db95656b"}]}, "item_keyword": {"attribute_name": "キーワード", "attribute_value_mlt": [{"subitem_subject": "Quadrangulation", "subitem_subject_scheme": "Other"}, {"subitem_subject": "Anti-rainbow coloring", "subitem_subject_scheme": "Other"}, {"subitem_subject": "Non-rainbow coloring", "subitem_subject_scheme": "Other"}, {"subitem_subject": "Looseness", "subitem_subject_scheme": "Other"}, {"subitem_subject": "Dividing system", "subitem_subject_scheme": "Other"}]}, "item_language": {"attribute_name": "言語", "attribute_value_mlt": [{"subitem_language": "eng"}]}, "item_resource_type": {"attribute_name": "資源タイプ", "attribute_value_mlt": [{"resourcetype": "journal article", "resourceuri": "http://purl.org/coar/resource_type/c_6501"}]}, "item_title": "Proper Colorings of Plane Quadrangulations Without Rainbow Faces", "item_titles": {"attribute_name": "タイトル", "attribute_value_mlt": [{"subitem_title": "Proper Colorings of Plane Quadrangulations Without Rainbow Faces"}]}, "item_type_id": "2", "owner": "3", "path": ["501"], "permalink_uri": "http://hdl.handle.net/10131/00014013", "pubdate": {"attribute_name": "公開日", "attribute_value": "2022-06-12"}, "publish_date": "2022-06-12", "publish_status": "0", "recid": "11354", "relation": {}, "relation_version_is_last": true, "title": ["Proper Colorings of Plane Quadrangulations Without Rainbow Faces"], "weko_shared_id": -1}
Proper Colorings of Plane Quadrangulations Without Rainbow Faces
http://hdl.handle.net/10131/00014013
http://hdl.handle.net/10131/000140132c02a846-b0e0-4b19-8b79-9da63ca3d2f1
名前 / ファイル | ライセンス | アクション |
---|---|---|
dividing_system_2021_0522.pdf (203.9 kB)
|
|
Item type | 学術雑誌論文 / Journal Article(1) | |||||
---|---|---|---|---|---|---|
公開日 | 2022-06-12 | |||||
タイトル | ||||||
タイトル | Proper Colorings of Plane Quadrangulations Without Rainbow Faces | |||||
言語 | ||||||
言語 | eng | |||||
キーワード | ||||||
主題 | Quadrangulation, Anti-rainbow coloring, Non-rainbow coloring, Looseness, Dividing system | |||||
資源タイプ | ||||||
資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||
資源タイプ | journal article | |||||
著者 |
Enami, Kengo
× Enami, Kengo× Ozeki, Kenta× Yamaguchi, Tomoki |
|||||
著者別名 | ||||||
識別子Scheme | WEKO | |||||
識別子 | 39964 | |||||
姓名 | College, of Engineering Science Yokohama National University | |||||
著者所属 | ||||||
Department of Computer and Information Science, Faculty of Science and Technology, Seikei University | ||||||
著者所属 | ||||||
Faculty of Environment and Information Sciences, Yokohama National University | ||||||
抄録 | ||||||
内容記述タイプ | Abstract | |||||
内容記述 | We consider a proper coloring of a plane graph such that no face is rainbow, where a face is rainbow if any two vertices on its boundary have distinct colors. Such a coloring is said to be proper anti-rainbow. A plane quadrangulation G is a plane graph in which all faces are bounded by a cycle of length 4. In this paper, we show that the number of colors in a proper anti-rainbow coloring of a plane quadrangulation G does not exceed 3α(G)/2, where α(G) is the independence number of G. Moreover, if the minimum degree of G is 3 or if G is 3-connected, then this bound can be improved to 5α(G)/4 or 7α(G)/6+1/3, respectively. All of these bounds are tight. | |||||
内容記述 | ||||||
内容記述タイプ | Other | |||||
内容記述 | This is a post-peer-review, pre-copyedit version of an article published in Graphs and Combinatorics. The final authenticated version is available online at: http://dx.doi.org/10.1007/s00373-021-02350-5 | |||||
書誌情報 |
Graphs and combinatorics 発行日 2021-06-12 |
|||||
ISSN | ||||||
収録物識別子タイプ | ISSN | |||||
収録物識別子 | 14355914 | |||||
書誌レコードID | ||||||
収録物識別子タイプ | NCID | |||||
収録物識別子 | AA11623984 | |||||
DOI | ||||||
関連タイプ | isVersionOf | |||||
識別子タイプ | DOI | |||||
関連識別子 | info:doi/10.1007/s00373-021-02350-5 | |||||
著者版フラグ | ||||||
出版タイプ | AM | |||||
出版タイプResource | http://purl.org/coar/version/c_ab4af688f83e57aa | |||||
出版者 | ||||||
出版者 | Springer | |||||
関係URI | ||||||
識別子タイプ | DOI | |||||
関連識別子 | https://doi.org/10.1007/s00373-021-02350-5 | |||||
関連名称 | https://doi.org/10.1007/s00373-021-02350-5 |