Partitioning a triangle-free planar graph into a forest and a forest of bounded degree (Q6829915)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6773726
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
11 September 2017
0 references
\((\mathcal{F},\mathcal{F}_5)\)-partition
0 references
