Almost Every Graph can be Covered by Linear Forests (Q4862746)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Publication:4862746 |
scientific article; zbMATH DE number 843714
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8925209641456604
0 references
0.8621683120727539
0 references
0.8550571203231812
0 references
0.845940887928009
0 references
