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
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 28, 2017 at 10:29 | history | edited | Userbejian29 | CC BY-SA 3.0 |
deleted 32 characters in body; edited title
|
| Sep 28, 2017 at 10:29 | answer | added | Peter Heinig | timeline score: 1 | |
| Sep 28, 2017 at 10:17 | comment | added | Peter Heinig | Dear @Userbejian29: please note that your use of "bounded degree" is sort-of-a-misuse of standard graph-theoretic terminology: 'bounded degree' is used if the context contains an infinite sequence of graphs. (Search for yourself.) What you mean is simple 'with maximum degree $<k$'. This is a usual way to put it. Would you please say it this way? (Unless for some strange reason you really really insist on this unusual use of 'bounded degree'.) | |
| Sep 28, 2017 at 10:09 | history | edited | Userbejian29 | CC BY-SA 3.0 |
added 181 characters in body
|
| Sep 28, 2017 at 10:02 | history | edited | Userbejian29 | CC BY-SA 3.0 |
edited tags; edited title
|
| Sep 28, 2017 at 9:37 | comment | added | Mikhail Tikhomirov | The paths you are talking about actually have nothing to do with Hamiltonian paths, right? Better edit the title and the tags. | |
| Sep 28, 2017 at 9:32 | history | asked | Userbejian29 | CC BY-SA 3.0 |