On point-linear arboricity of planar graphs (Q1115876)
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 4087678
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On point-linear arboricity of planar graphs |
scientific article; zbMATH DE number 4087678 |
Statements
On point-linear arboricity of planar graphs (English)
0 references
1988
0 references
The point-linear arboricity \(\rho_ 0(G)\) of a graph G is defined to be the minimal k for which there exists a partition of vertices of G into k subsets such that each of the subsets induces a linear forest in G. The author proves that \(\rho_ 0(G)\leq 4\) if G is planar.
0 references
planar graph
0 references
outerplanar graph
0 references
point-linear arboricity
0 references
0.8334899544715881
0 references
0.804470956325531
0 references
