Partitioning a triangle-free planar graph into a forest and a forest of bounded degree (Q5890907)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Partitioning a triangle-free planar graph into a forest and a forest of bounded degree |
scientific article; zbMATH DE number 6773726
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Partitioning a triangle-free planar graph into a forest and a forest of bounded degree |
scientific article; zbMATH DE number 6773726 |
Statements
Partitioning a triangle-free planar graph into a forest and a forest of bounded degree (English)
0 references
14 October 2016
0 references
11 September 2017
0 references
triangle-free planar graph
0 references
vertex partition
0 references
forest
0 references
bounded degree
0 references
\((\mathcal{F},\mathcal{F}_5)\)-partition
0 references
0 references
