Partitioning a triangle-free planar graph into a forest and a forest of bounded degree (Q5920083): Difference between revisions
From MaRDI portal
Item:Q5920083
Set OpenAlex properties. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 1601.01523 / rank | |||
Normal rank | |||
Revision as of 13:34, 18 April 2024
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
11 September 2017
0 references
\((\mathcal{F},\mathcal{F}_5)\)-partition
0 references
