Linear arboricity and linear \(k\)-arboricity of regular graphs (Q5936088): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q57310373, #quickstatements; #temporary_batch_1704701117765 |
Set profile property. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 23:41, 4 March 2024
scientific article; zbMATH DE number 1612982
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Linear arboricity and linear \(k\)-arboricity of regular graphs |
scientific article; zbMATH DE number 1612982 |
Statements
Linear arboricity and linear \(k\)-arboricity of regular graphs (English)
0 references
29 March 2002
0 references
The linear arboricity \(\text{la}(G)\) (respectively, \(k\)-linear arboricity \(\text{la}_k(G)\)), of a graph \(G\) is the minimum number of forests, each of whose components is a path (respectively, each of whose components is a path of length at most \(k\)) required to partition \(E(G)\); \(\text{la}_k(d)\) is defined to be \(\max_{G \text{ is }d}-regular\)
0 references
linear arboricity
0 references
