Timeline for Bounds on the number of proper 3-colorings of cubic graphs
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 15 at 0:41 | vote | accept | Tuatarian | ||
| Nov 7 at 14:55 | answer | added | Gordon Royle | timeline score: 1 | |
| Nov 6 at 17:09 | review | Low quality posts | |||
| Nov 6 at 17:17 | |||||
| Nov 6 at 16:57 | comment | added | Tuatarian | I changed the question to be for 3 regular graphs | |
| Nov 6 at 16:57 | history | edited | Tuatarian | CC BY-SA 4.0 |
changed question to 3-regular
|
| Nov 5 at 10:12 | comment | added | Gordon Royle | You may need to constrain the graph in some way, otherwise $n$ isolated vertices gives you $3^n$ colourings. | |
| Nov 4 at 20:35 | history | asked | Tuatarian | CC BY-SA 4.0 |