2000 character limit reached
Partitioning a Planar Graph into two Triangle-Forests (2401.15394v3)
Published 27 Jan 2024 in math.CO and cs.DM
Abstract: We show that the vertices of every planar graph can be partitioned into two sets, each inducing a so-called triangle-forest, i.e., a graph with no cycles of length more than three. We further discuss extensions to locally planar graphs. After finishing the paper we noticed that our main result was already proved much earlier by Carsten Thomassen [Decomposing a Planar Graph into Degenerate Graphs, JCTB 1995].
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.