A Combinatorial Algorithm to Optimally Colour the Edges of the Graphs That Are Join of Regular Graphs (Q5505673)
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: A Combinatorial Algorithm to Optimally Colour the Edges of the Graphs That Are Join of Regular Graphs |
scientific article; zbMATH DE number 5498470
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Combinatorial Algorithm to Optimally Colour the Edges of the Graphs That Are Join of Regular Graphs |
scientific article; zbMATH DE number 5498470 |
Statements
A Combinatorial Algorithm to Optimally Colour the Edges of the Graphs That Are Join of Regular Graphs (English)
0 references
27 January 2009
0 references
0.9690596461296082
0 references
0.9361465573310852
0 references
0.8478288054466248
0 references
0.7859673500061035
0 references
0.7852644324302673
0 references
