Partitioning kite‐free planar graphs into two forests-Reference-Cited by-同舟云学术

Partitioning kite‐free planar graphs into two forests

Published:2023-12-12 Issue: Volume: Page:
ISSN:0364-9024
Container-title:Journal of Graph Theory
language:en
Short-container-title:Journal of Graph Theory

Author:

Wang Yang¹,Wang Yiqiao²^ORCID,Lih Ko‐Wei³

Affiliation:

1. Department of Mathematics Zhejiang Normal University Jinhua China

2. Department of Mathematics Beijing University of Technology Beijing China

3. Institute of Mathematics Academia Sinica Taipei Taiwan

Abstract

AbstractA 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.

Funder

National Natural Science Foundation of China

Publisher

Wiley

Subject

Geometry and Topology,Discrete Mathematics and Combinatorics

Link

https://onlinelibrary.wiley.com/doi/pdf/10.1002/jgt.23062

Reference9 articles.

1. The point-arboricity of a graph

2. The Point-Arboricity of Planar Graphs

3. Vertex-arboricity of planar graphs without intersecting triangles

4. M. R.Garey andD. S.Johnson Computers and intractability: A guide to the theory of NP‐completeness W.H. Freeman and Company New York 1979.

5. Acyclic colorings of planar graphs

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Partitioning planar graphs into bounded degree forests;Applied Mathematics and Computation;2024-08

2. Partitioning a planar graph without chordal 5-cycles into two forests;Czechoslovak Mathematical Journal;2024-06-03