Now showing items 1-1 of 1
Coloração de Arestas em Grafos Split-Comparabilidade
(Universidade Federal de São Carlos, 2017-05-02)
Let G = (V, E) be a simple and undirected graph. An edge-coloring is an assignment of colors to the edges of the graph such that any two adjacent edges receive different colors. The chromatic index of a graph G is the ...