The linear \((n - 1)\)-arboricity of some lexicographic product graphs (Q2335741)
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 7130573
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The linear \((n - 1)\)-arboricity of some lexicographic product graphs |
scientific article; zbMATH DE number 7130573 |
Statements
The linear \((n - 1)\)-arboricity of some lexicographic product graphs (English)
0 references
15 November 2019
0 references
linear \(k\)-arboricity
0 references
Cartesian product graph
0 references
lexicographic product graph
0 references
bipartite difference
0 references
0 references
0.913577437400818
0 references
0.8872458338737488
0 references
0.8739710450172424
0 references
0.8732843399047852
0 references
0.8560043573379517
0 references
