Total Coloring Conjecture for Certain Classes of Graphs
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 colori...
Na minha lista:
| Principais autores: | , , |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
MDPI AG
2018-10-01
|
| coleção: | Algorithms |
| Assuntos: | |
| Acesso em linha: | http://www.mdpi.com/1999-4893/11/10/161 |
| Tags: |
Sem tags, seja o primeiro a adicionar uma tag!
|