Partitioning a triangle-free planar graph into a forest and a forest of bounded degree (Q5890907): Difference between revisions
From MaRDI portal
EloiFerrer (talk | contribs) Changed label, description and/or aliases in en, and other parts |
EloiFerrer (talk | contribs) Page on [mardi] deleted: Publication:5890907 |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 12:17, 29 April 2024
No description defined
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Partitioning a triangle-free planar graph into a forest and a forest of bounded degree |
No description defined |
Statements
Partitioning a triangle-free planar graph into a forest and a forest of bounded degree (English)
0 references
14 October 2016
0 references
triangle-free planar graph
0 references
vertex partition
0 references
forest
0 references
bounded degree
0 references
