Informatics
 |
|
20 october 2018 04:02:38 |
| Algorithms, Vol. 11, Pages 161: Total Coloring Conjecture for Certain Classes of Graphs (Algorithms) |
|
Tweet A total coloring of a graph G is an assignment of colors to the elements of the graph G such that no two adjacent or incident elements receive the same color. The total chromatic number of a graph G, denoted by ? ´ ´ ( G ) , is the minimum number of colors that suffice in a total coloring. Behzad and Vizing conjectured that for any graph G, ? ( G ) + 1 |
| 75 viewsCategory: Informatics |
 Algorithms, Vol. 11, Pages 158: Incremental Learning for Classification of Unstructured Data Using Extreme Learning Machine (Algorithms)Algorithms, Vol. 11, Pages 160: Modeling and Evaluation of Power-Aware Software Rejuvenation in Cloud Systems (Algorithms) 
|
| blog comments powered by Disqus |
MyJournals.org
The latest issues of all your favorite science journals on one page
The latest issues of all your favorite science journals on one page
