Partitioning a Planar Graph into two Triangle-Forests
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866914977054457856 |
|---|---|
| author | Knauer, Kolja Rambaud, Clément Ueckerdt, Torsten |
| author_facet | Knauer, Kolja Rambaud, Clément Ueckerdt, Torsten |
| contents | 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]. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2401_15394 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Partitioning a Planar Graph into two Triangle-Forests Knauer, Kolja Rambaud, Clément Ueckerdt, Torsten Combinatorics Discrete Mathematics 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]. |
| title | Partitioning a Planar Graph into two Triangle-Forests |
| topic | Combinatorics Discrete Mathematics |
| url | https://arxiv.org/abs/2401.15394 |