Partitioning kite-free planar graphs into two forests

IF 0.9 3区数学 Q2 MATHEMATICS

Journal of Graph Theory Pub Date : 2023-12-12 DOI:10.1002/jgt.23062

Yang Wang, Yiqiao Wang, Ko-Wei Lih

引用次数: 0

Abstract

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.

查看原文本刊更多论文

将无筝平面图划分为两个森林

风筝图是四个顶点上去掉一条边的完整图。研究证明，每个没有风筝子图的平面图都可以划分为两个诱导森林。这解决了 Raspaud 和 Wang 在 2008 年提出的一个猜想。

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

求助全文

约1分钟内获得全文求助全文

来源期刊

Journal of Graph Theory 数学-数学

CiteScore

1.60

自引率

22.20%

发文量

130

审稿时长

6-12 weeks

期刊介绍： 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 .