The strong equitable vertex 2-arboricity of complete bipartite and tripartite graphs (Q318921)
From MaRDI portal
(Redirected from Item:Q393362)
 | 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 strong equitable vertex 2-arboricity of complete bipartite and tripartite graphs |
scientific article; zbMATH DE number 6246972
- The strong chromatic index of graphs and subdivisions
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The strong equitable vertex 2-arboricity of complete bipartite and tripartite graphs |
scientific article; zbMATH DE number 6246972 |
|
Statements
The strong equitable vertex 2-arboricity of complete bipartite and tripartite graphs (English)
0 references
The strong chromatic index of graphs and subdivisions (English)
0 references
6 October 2016
0 references
17 January 2014
0 references
graph algorithms
0 references
combinatorial problems
0 references
vertex \(k\)-arboricity
0 references
complete bipartite graphs
0 references
complete tripartite graphs
0 references
strong edge-coloring
0 references
strong chromatic index
0 references
incidence coloring
0 references
subdivision
0 references
0.8636560440063477
0 references
0.8500153422355652
0 references
0.8490643501281738
0 references
0.8457219004631042
0 references
