Vertex arboricity and maximum degree (Q1894756): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0012-365x(93)e0205-i / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2013436809 / rank | |||
Normal rank | |||
Latest revision as of 10:47, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Vertex arboricity and maximum degree |
scientific article |
Statements
Vertex arboricity and maximum degree (English)
0 references
24 July 1995
0 references
This paper mainly proves that if a connected graph \(G= (V,E)\) is neither a cycle nor a clique, then there is a coloring of \(V\) with at most \(\lceil {{\Delta (G)} \over 2} \rceil\) colors such that all color classes induce forests and one of them is a minimum induced forest in \(G\).
0 references
arboricity
0 references
maximum degree
0 references
chromatic number
0 references
coloring
0 references
colors
0 references
forests
0 references
