An efficient case for computing minimum linear arboricity with small maximum degree (Q2414123): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 21:34, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient case for computing minimum linear arboricity with small maximum degree |
scientific article |
Statements
An efficient case for computing minimum linear arboricity with small maximum degree (English)
0 references
10 May 2019
0 references
linear arboricity
0 references
cycles
0 references
planar graph
0 references
