Submission declined on 8 June 2026 by Staraction (talk). This draft appears to contain copyrighted material from https://www.ac.tuwien.ac.at/files/pub/volko-13.pdf, which has been removed. Wikipedia strictly prohibits copyright violations. Assume all text is copyrighted unless released under a compatible license. We can only accept text if it is explicitly released under a compatible free license or is in the public domain. If the text is not freely licensed, you must rewrite or summarize it entirely in your own words. Changing a few words is still considered a copyright violation. If you own the text you cannot paste it here unless you formally release it via our release process. Users who continue to post copyrighted material may be blocked from editing Wikipedia. This submission has now been cleaned of the above-noted copyright violation and its history redacted by an administrator to remove the infringement. If re-submitted (and subsequent additions do not reintroduce copyright problems), the content may be assessed on other grounds. If you would like to continue working on the submission, click on the "Edit" tab at the top of the window. If you have not resolved the issues listed above, your draft will be declined again and potentially deleted. If you need extra help, please ask us a question at the AfC Help Desk or get live help from experienced editors. Please do not remove reviewer comments or this notice until the submission is accepted. Where to get help If you need help editing or submitting your draft, please ask us a question at the AfC Help Desk or get live help from experienced editors. These venues are only for help with editing and the submission process, not to get reviews. If you need feedback on your draft, or if the review is taking a lot of time, you can try asking for help on the talk page of a relevant WikiProject. Some WikiProjects are more active than others so a speedy reply is not guaranteed. How to improve a draft Wikipedia:Contributing to Wikipedia – a basic overview on how to edit Wikipedia. Help:Wikitext – how to use the markup Help:Referencing for beginners – how to include references Wikipedia:Article development – how to develop your article Wikipedia:Writing better articles – how to improve your article Wikipedia:Verifiability – make sure your article includes reliable third-party sources You can also browse Wikipedia:Featured articles and Wikipedia:Good articles to find examples of Wikipedia's best writing on topics similar to your proposed article. Improving your odds of a speedy review To improve your odds of a faster review, tag your draft with relevant WikiProject tags using the button below. This will let reviewers know a new draft has been submitted in their area of interest. For instance, if you wrote about a female astronomer, you would want to add the Biography, Astronomy, and Women scientists tags. Add tags to your draft Editor resources Easy tools: Citation bot (help) | Advanced: Fix bare URLs Declined by Staraction 13 hours ago. Last edited by Asukite 12 hours ago. Reviewer: Inform author. Resubmit Please note that if the issues are not fixed, the draft will be declined again.

• Comment: Entire lede is lifted from the source, word-for-word. Please rephrase in your own words. Staraction (talk · contribs) 13:25, 8 June 2026 (UTC)

^{[1] [2] [3] [4] [5] [6] [7] [8]}

Given is an unweighted, undirected graph G =< V, E > with a set of nodes V and a set of edges E. Each node is assigned to one subgraph, a so-called cluster Ci. In total there are n disjoint clusters. The goal is to find a subgraph S = G(W) with W =< v1, ..., vn > where vi ∈ Ci, 1 ≤ i ≤ n. The subgraph should have a minimal chromatic number. The chromatic number is the minimal number of different colors using which the nodes of a graph can be colored so that there is no single pair of nodes u and v connected by an edge (u, v) that have the same color.

Thus, the SGCP is an extension of the graph coloring problem, which computer scientists and mathematicians have studied for decades. The Graph Coloring Problem is about computing the chromatic number of a given graph, and already in 1972 it was discovered to be an NP-equivalent problem. ^[9] Since the Graph Coloring Problem is a subproblem of the selective graph coloring problem, the selective graph coloring problem is NP-hard as well. For this reason it makes sense to use a heuristic approach both to estimate the chromatic number of a possible solution and to find a better solution.