Planar graphs with distance of 3-cycles at least 2 and no cycles of lengths 5, 6, 7

IF 3.5 2区 数学 Q1 MATHEMATICS, APPLIED Applied Mathematics and Computation Pub Date : 2024-07-15 DOI:10.1016/j.amc.2024.128946
{"title":"Planar graphs with distance of 3-cycles at least 2 and no cycles of lengths 5, 6, 7","authors":"","doi":"10.1016/j.amc.2024.128946","DOIUrl":null,"url":null,"abstract":"<div><p>Weak degeneracy of a graph is a variation of degeneracy that has a close relationship to many graph coloring parameters. In this article, we prove that planar graphs with distance of 3-cycles at least 2 and no cycles of lengths <span><math><mn>5</mn><mo>,</mo><mn>6</mn><mo>,</mo><mn>7</mn></math></span> are weakly 2-degenerate. Furthermore, such graphs can be vertex-partitioned into two subgraphs, one of which has no edges, and the other is a forest.</p></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":null,"pages":null},"PeriodicalIF":3.5000,"publicationDate":"2024-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied Mathematics and Computation","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0096300324004077","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

Abstract

Weak degeneracy of a graph is a variation of degeneracy that has a close relationship to many graph coloring parameters. In this article, we prove that planar graphs with distance of 3-cycles at least 2 and no cycles of lengths 5,6,7 are weakly 2-degenerate. Furthermore, such graphs can be vertex-partitioned into two subgraphs, one of which has no edges, and the other is a forest.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
3 个循环的距离至少为 2,且没有长度为 5、6、7 的循环的平面图形
图形的弱退化性是退化性的一种变化,与许多图形着色参数有密切关系。在本文中,我们证明了三循环距离至少为 2 且没有长度为 5、6、7 的循环的平面图是弱 2 退化图。此外,这种图可以被顶点分割成两个子图,其中一个没有边,另一个是森林。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
7.90
自引率
10.00%
发文量
755
审稿时长
36 days
期刊介绍: Applied Mathematics and Computation addresses work at the interface between applied mathematics, numerical computation, and applications of systems – oriented ideas to the physical, biological, social, and behavioral sciences, and emphasizes papers of a computational nature focusing on new algorithms, their analysis and numerical results. In addition to presenting research papers, Applied Mathematics and Computation publishes review articles and single–topics issues.
期刊最新文献
Mass conservation in the validation of fluid-poroelastic structure interaction solvers Evolution of cooperation with asymmetric rewards A robust shape model for blood vessels analysis Efficient spectral element method for the Euler equations on unbounded domains Signed total Roman domination and domatic numbers in 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