Almost Every Graph can be Covered by Linear Forests (Q4862746): Difference between revisions
From MaRDI portal
Latest revision as of 09:39, 24 May 2024
scientific article; zbMATH DE number 843714
Language | Label | Description | Also known as |
---|---|---|---|
English | Almost Every Graph can be Covered by Linear Forests |
scientific article; zbMATH DE number 843714 |
Statements
Almost Every Graph can be Covered by Linear Forests (English)
0 references
12 February 1996
0 references
random variable
0 references
linear forest
0 references
linear arboricity
0 references
maximum degree
0 references
probabilistic methods
0 references