Partitioning a triangle-free planar graph into a forest and a forest of bounded degree (Q5920083): Difference between revisions
From MaRDI portal
Item:Q5920083
Changed an Item |
EloiFerrer (talk | contribs) Page moved from [mardi:Publication:5920083] to [mardi:Publication:5890907] |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 12:17, 29 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
