ABSTRACT: A proper edge coloring of a graph is acyclic, if every cycle of the graph has at least 3 colors. Let r be a positive integer. An edge coloring is r-acyclic if it is proper and every cycle C ...

Abstract: The graph coloring problem functions as a fundamental and pivotal combinatorial optimization task and has played an essential role in various domains such as wireless spectrum management, ...

Repositorio sobre el uso de algoritmos de exploración de grafos para resolver problemas como "Orden Topológico" y "Coloreado de grafos.

ABSTRACT: In this article we propose a new model for scheduling periodic tasks. The model is based on a variation of the circular chromatic number, called the multiple circular colouring of the ...