Timeline for Variant of Graph coloring
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 1, 2017 at 12:09 | history | bounty ended | CommunityBot | ||
| Sep 27, 2017 at 4:25 | comment | added | domotorp | @user1659936 Well now that you know the nomenclature and the relevant papers, you can start looking through the literature in the hope of finding related results. | |
| Sep 26, 2017 at 18:00 | comment | added | user1659936 | thanks for the update, but again my question is for restricted classes of graphs, specifically threshold graphs. | |
| Sep 26, 2017 at 11:47 | comment | added | domotorp | @user1659936 I've updated my answer. | |
| Sep 26, 2017 at 11:46 | history | edited | domotorp | CC BY-SA 3.0 |
added update
|
| Sep 23, 2017 at 11:26 | history | edited | domotorp | CC BY-SA 3.0 |
added that it's only for two colors
|
| Sep 23, 2017 at 11:24 | comment | added | user1659936 | It is polynomially solvable on any graph if the number of colors is at most two. What happens when the number of colors is more than two? | |
| Sep 23, 2017 at 11:15 | history | answered | domotorp | CC BY-SA 3.0 |