Linear vertex arboricity, independence number and clique cover number. (Q2716006)
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 1600974
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Linear vertex arboricity, independence number and clique cover number. |
scientific article; zbMATH DE number 1600974 |
Statements
20 July 2005
0 references
linear vertex-arboricity
0 references
independent set
0 references
clique covering
0 references
Linear vertex arboricity, independence number and clique cover number. (English)
0 references
Linear vertex-arboricity of a graph is the smallest number of subsets into which the vertex set of the graph can be partitioned so that every subset induces a linear forest. In the paper are considered the sum and product of linear vertex-arboricity with given independence number and given clique cover number respectively. Some sharp lower and upper bounds are obtained.
0 references
0.8481656312942505
0 references
0.8317894339561462
0 references
