Timeline for Coloring graph with maximum vertex degree $< k$ so every vertex is a starting point for a path containing each color
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 28, 2017 at 10:43 | history | edited | Peter Heinig | CC BY-SA 3.0 |
Improvements.
|
| Sep 28, 2017 at 10:41 | comment | added | Peter Heinig | @MikhailTikhomirov: thanks for pointing out. This is not my intent. I find the 'reference request' section, within reason, very valuable. I will edit the answer. But an answer it is, I think. (Though it should be Theorem 3, not 1). I will edit. | |
| Sep 28, 2017 at 10:29 | history | answered | Peter Heinig | CC BY-SA 3.0 |