Results 291 to 300 of about 84,087 (307)
Some of the next articles are maybe not open access.
Proceedings of the 49th Annual Southeast Regional Conference, 2011
There are basically three main graph coloring problems: vertex, edge, or face colorings of a given graph G. Graph colorings have applications in many optimization problems mainly in scheduling and assignment. In this study, we define color sequence, maximum color sequence, perfect color sequence, and almost perfect color sequence.
openaire +1 more source
There are basically three main graph coloring problems: vertex, edge, or face colorings of a given graph G. Graph colorings have applications in many optimization problems mainly in scheduling and assignment. In this study, we define color sequence, maximum color sequence, perfect color sequence, and almost perfect color sequence.
openaire +1 more source