Partitioning kite-free planar graphs into two forests

JOURNAL OF GRAPH THEORY（2024）

引用 0|浏览0

暂无评分

摘要

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.

查看译文

关键词

induced forest,kite,planar graph,triangle,vertex-arboricity,vertex partition

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要