Timeline for Is it NP hard to partition a graph into 2 vertex sets with minimum degree of 2 and 3?
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 24, 2018 at 7:36 | vote | accept | Mengfan Ma | ||
| May 23, 2018 at 6:02 | history | edited | xskxzr | CC BY-SA 4.0 |
added 97 characters in body
|
| May 23, 2018 at 5:48 | comment | added | xskxzr | @Mark No, otherwise the rightmost unnamed vertex can be colored blue with all $u,v,w$ colored blue. | |
| May 23, 2018 at 4:53 | comment | added | Mengfan Ma | Can we use the same structure in the second construction as the one in the first construction, which has ensured all the unnamed vertices are red ? | |
| May 21, 2018 at 10:48 | history | edited | Discrete lizard♦ | CC BY-SA 4.0 |
clarify structure definitions
|
| May 21, 2018 at 9:11 | history | answered | xskxzr | CC BY-SA 4.0 |