Learn More
The contents of this report are the sole responsibility of the authors. O conteúdo do presente relatório é de única responsabilidade dos autores. Abstract The total chromatic number χ T (G) is the least number of colours needed to colour the vertices and edges of a graph G, such that no incident or adjacent elements (vertices or edges) receive the same(More)