Degree Sum Condition for Vertex-Disjoint 5-Cycles

IF 0.5 4区 数学 Q3 MATHEMATICS Discussiones Mathematicae Graph Theory Pub Date : 2022-05-27 DOI:10.7151/dmgt.2458
Maoqun Wang, Jianguo Qian
{"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":48875,"journal":{"name":"Discussiones Mathematicae Graph Theory","volume":null,"pages":null},"PeriodicalIF":0.5000,"publicationDate":"2022-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discussiones Mathematicae Graph Theory","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.7151/dmgt.2458","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

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.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
顶点不连续5-环的度和条件
摘要设n和k是两个整数,G是一个有n=5k个顶点的图。王证明了如果δ(G)≥3k,则G包含k个长度为5的顶点不相交环。2018年,千叶和山下询问度条件是否可以用度和条件代替。在本文中,我们对这个问题给出了肯定的回答。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
2.20
自引率
0.00%
发文量
22
审稿时长
53 weeks
期刊介绍: The Discussiones Mathematicae Graph Theory publishes high-quality refereed original papers. Occasionally, very authoritative expository survey articles and notes of exceptional value can be published. The journal is mainly devoted to the following topics in Graph Theory: colourings, partitions (general colourings), hereditary properties, independence and domination, structures in graphs (sets, paths, cycles, etc.), local properties, products of graphs as well as graph algorithms related to these topics.
期刊最新文献
3-Neighbor bootstrap percolation on grids Connected coalitions in graphs General sharp upper bounds on the total coalition number Disjoint maximal independent sets in graphs and hypergraphs Semitotal forcing in claw-free cubic graphs
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1