On the thickness and arboricity of a graph (Q1121907): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q56689313, #quickstatements; #temporary_batch_1706974296281 |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 02:16, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the thickness and arboricity of a graph |
scientific article |
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
