The equitable vertex arboricity of complete tripartite graphs (Q495689)
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: The equitable vertex arboricity of complete tripartite graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The equitable vertex arboricity of complete tripartite graphs |
scientific article |
Statements
The equitable vertex arboricity of complete tripartite graphs (English)
0 references
15 September 2015
0 references
combinatorial problems
0 references
equitable coloring
0 references
vertex \(k\)-arboricity
0 references
\(k\)-tree-coloring
0 references
complete tripartite graph
0 references
0 references
0.9875910878181458
0 references
0.956301748752594
0 references
0.881793200969696
0 references
0.8513274192810059
0 references
0.833758533000946
0 references
