Results 291 to 300 of about 18,582 (315)
Some of the next articles are maybe not open access.
Cycles Avoiding a Color in Colorful Graphs
Journal of Graph Theory, 2015AbstractThe Ramsey numbers of cycles imply that every 2‐edge‐colored complete graph on n vertices contains monochromatic cycles of all lengths between 4 and at least . We generalize this result to colors by showing that every k‐edge‐colored complete graph on vertices contains ‐edge‐colored cycles of all lengths between 3 and at least .
Dirk Meierling +2 more
openaire +1 more source
2012
In this paper, we introduce and study a new coloring problem of a graph called the dominated coloring. A dominated coloring of a graph $G$ is a proper vertex coloring of $G$ such that each color class is dominated by at least one vertex of $G$. The minimum number of colors among all dominated colorings is called the dominated chromatic number, denoted ...
Boumediene Merouane, Hocine +3 more
openaire +2 more sources
In this paper, we introduce and study a new coloring problem of a graph called the dominated coloring. A dominated coloring of a graph $G$ is a proper vertex coloring of $G$ such that each color class is dominated by at least one vertex of $G$. The minimum number of colors among all dominated colorings is called the dominated chromatic number, denoted ...
Boumediene Merouane, Hocine +3 more
openaire +2 more sources
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
A deep learning guided memetic framework for graph coloring problems
Knowledge-Based Systems, 2022Olivier Goudet +2 more
exaly
Population-based gradient descent weight learning for graph coloring problems
Knowledge-Based Systems, 2021Beatrice Duval, Jin-Kao Hao
exaly
A systematic study on meta-heuristic approaches for solving the graph coloring problem
Computers and Operations Research, 2020Farzin Modarres Khiyabani +1 more
exaly
Improvements to graph coloring register allocation
ACM Transactions on Programming Languages and Systems, 1994Keith D Cooper +2 more
exaly
On some applications of the selective graph coloring problem
European Journal of Operational Research, 2015Marc Demange +2 more
exaly
A memetic algorithm for graph coloring
European Journal of Operational Research, 2010Zhipeng Lu, Jin-Kao Hao
exaly