"Graph Coloring Algorithms" in the journal Algorithms, an EI-, ESCI-,
and Scopus-indexed open access journal.
We are looking for new developments in classical graph coloring problems
and also algorithms using graph coloring as a tool to improve
computations for other graph invariants, such as the independence number
or maximum cuts. We encourage submissions of results on algorithms
dealing with coloring with additional constraints, which have been
applied in other areas of science.
Further information can be found at the Special Issue website:
https://www.mdpi.com/journal/algorithms/special_issues/Graph_Coloring
The submission deadline is 30 October 2020. Papers will be published on
an ongoing basis, so you can submit your paper at any point before the
deadline.
We look forward to receiving your submission.
Best regards,
Ms. Hortensia Hou
CiteScore of Algorithms (2018): 1.46
CiteScoreTracker 2019 (updated on 9 April, 2020): 2.00
--
Skype: live:8869fb0f2dd74ce5
E-Mail: hortensia.hou@mdpi.com
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Posts
