En esta tesis se estudian tres tipos de coloraciones de aristas de grafos. En el primer capítulo, la introducción, damos una breve historia de las coloraciones de grafos. Luego hacemos una descripción de coloraciones de ...

Let G and \bar{G} be two complementary graphs. Given a penalty function defined over the edges of \bar{G}, it is said that the rigidity of a k-coloring of G is the summation ofthe penalties of the edges of G that join ...

Let G and \bar{G} be two complementary graphs. Given a penalty function defined over the edges of \bar{G}, it is said that the rigidity of a k-coloring of G is the summation ofthe penalties of the edges of G that join ...

"Visually aposematic prey warn their potential predators about their noxious condition by exhibiting conspicuous coloration. The larvae of some phyllomedusine frogs bear bright patches on the body or tail that suggest an ...

The study of the theory of graphs began several years ago, with the study of the problem of the bridges of Königsberg realized by Euler. Then, in the middle of the nineteenth century, this study reappeared when mathematicians ...

Uno de los problemas más conocidos y estudiados de la teoría de gráficas es el problema de coloración. Un caso especial del problema de coloración supuso una de las preguntas matemáticas más controvertidas de la humanidad, ...