On the thickness and arboricity of a graph (Q1121907)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4104997
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the thickness and arboricity of a graph |
scientific article; zbMATH DE number 4104997 |
Statements
On the thickness and arboricity of a graph (English)
0 references
1991
0 references
We prove that the thickness and the arboricity of a graph with e edges are at most \(\lfloor \sqrt{e/3}+3/2\rfloor\) and \(\lceil \sqrt{e/2}\rceil\), respectively, and that the latter bound is best possible.
0 references
thickness
0 references
arboricity
0 references
graph
0 references
0.8022816777229309
0 references
0.7974131107330322
0 references
0.7882193326950073
0 references
