Vertex arboricity and maximum degree (Q1894756)
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: Vertex arboricity and maximum degree |
scientific article; zbMATH DE number 778522
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Vertex arboricity and maximum degree |
scientific article; zbMATH DE number 778522 |
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
0 references
0.93760115
0 references
0.9120674
0 references
0 references
0.8955859
0 references
0.89367104
0 references
0.89106995
0 references
0.88947034
0 references
0.8893678
0 references
