3 个循环的距离至少为 2，且没有长度为 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":"3 个循环的距离至少为 2，且没有长度为 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":"{\"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}","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

摘要

图形的弱退化性是退化性的一种变化，与许多图形着色参数有密切关系。在本文中，我们证明了三循环距离至少为 2 且没有长度为 5、6、7 的循环的平面图是弱 2 退化图。此外，这种图可以被顶点分割成两个子图，其中一个没有边，另一个是森林。

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

查看原文本刊更多论文

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

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.

求助全文

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

来源期刊

Applied Mathematics and Computation 数学-应用数学

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.