顶点不连续5-环的度和条件

Pub Date : 2022-05-27 DOI:10.7151/dmgt.2458

Maoqun Wang, Jianguo Qian

{"title":"顶点不连续5-环的度和条件","authors":"Maoqun Wang, Jianguo Qian","doi":"10.7151/dmgt.2458","DOIUrl":null,"url":null,"abstract":"Abstract Let n and k be two integers and G a graph with n = 5k vertices. Wang proved that if δ (G) ≥ 3k, then G contains k vertex disjoint cycles of length 5. In 2018, Chiba and Yamashita asked whether the degree condition can be replaced by degree sum condition. In this paper, we give a positive answer to this question.","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Degree Sum Condition for Vertex-Disjoint 5-Cycles\",\"authors\":\"Maoqun Wang, Jianguo Qian\",\"doi\":\"10.7151/dmgt.2458\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract Let n and k be two integers and G a graph with n = 5k vertices. Wang proved that if δ (G) ≥ 3k, then G contains k vertex disjoint cycles of length 5. In 2018, Chiba and Yamashita asked whether the degree condition can be replaced by degree sum condition. In this paper, we give a positive answer to this question.\",\"PeriodicalId\":0,\"journal\":{\"name\":\"\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0,\"publicationDate\":\"2022-05-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.7151/dmgt.2458\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.7151/dmgt.2458","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

摘要设n和k是两个整数，G是一个有n=5k个顶点的图。王证明了如果δ（G）≥3k，则G包含k个长度为5的顶点不相交环。2018年，千叶和山下询问度条件是否可以用度和条件代替。在本文中，我们对这个问题给出了肯定的回答。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

Degree Sum Condition for Vertex-Disjoint 5-Cycles

Abstract Let n and k be two integers and G a graph with n = 5k vertices. Wang proved that if δ (G) ≥ 3k, then G contains k vertex disjoint cycles of length 5. In 2018, Chiba and Yamashita asked whether the degree condition can be replaced by degree sum condition. In this paper, we give a positive answer to this question.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助