{"title":"将无筝平面图划分为两个森林","authors":"Yang Wang, Yiqiao Wang, Ko-Wei Lih","doi":"10.1002/jgt.23062","DOIUrl":null,"url":null,"abstract":"<p>A kite is a complete graph on four vertices with one edge removed. It is proved that every planar graph without a kite as subgraph can be partitioned into two induced forests. This resolves a conjecture of Raspaud and Wang in 2008.</p>","PeriodicalId":16014,"journal":{"name":"Journal of Graph Theory","volume":null,"pages":null},"PeriodicalIF":0.9000,"publicationDate":"2023-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Partitioning kite-free planar graphs into two forests\",\"authors\":\"Yang Wang, Yiqiao Wang, Ko-Wei Lih\",\"doi\":\"10.1002/jgt.23062\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>A kite is a complete graph on four vertices with one edge removed. It is proved that every planar graph without a kite as subgraph can be partitioned into two induced forests. This resolves a conjecture of Raspaud and Wang in 2008.</p>\",\"PeriodicalId\":16014,\"journal\":{\"name\":\"Journal of Graph Theory\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2023-12-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Graph Theory\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1002/jgt.23062\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Graph Theory","FirstCategoryId":"100","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/jgt.23062","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
摘要
风筝图是四个顶点上去掉一条边的完整图。研究证明,每个没有风筝子图的平面图都可以划分为两个诱导森林。这解决了 Raspaud 和 Wang 在 2008 年提出的一个猜想。
Partitioning kite-free planar graphs into two forests
A kite is a complete graph on four vertices with one edge removed. It is proved that every planar graph without a kite as subgraph can be partitioned into two induced forests. This resolves a conjecture of Raspaud and Wang in 2008.
期刊介绍:
The Journal of Graph Theory is devoted to a variety of topics in graph theory, such as structural results about graphs, graph algorithms with theoretical emphasis, and discrete optimization on graphs. The scope of the journal also includes related areas in combinatorics and the interaction of graph theory with other mathematical sciences.
A subscription to the Journal of Graph Theory includes a subscription to the Journal of Combinatorial Designs .