收录:
摘要:
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. © 2023 Wiley Periodicals LLC.
关键词:
通讯作者信息:
电子邮件地址:
来源 :
Journal of Graph Theory
ISSN: 0364-9024
年份: 2024
期: 1
卷: 106
页码: 30-56
归属院系: