Timeline for Generating k-partite graphs
Current License: CC BY-SA 3.0
9 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Aug 31, 2013 at 14:06 | comment | added | caw | Ideally, I'd like graphs that are properly colored with t colors (i.e. $\chi(G) = t$). | |
Aug 31, 2013 at 0:52 | comment | added | Brendan McKay | Do you want graphs that can be properly coloured with $t$ colours, or graphs that are properly coloured with $t$ colours? The generation problem is entirely different for these two options. | |
Aug 30, 2013 at 16:08 | comment | added | caw | I have not. I'll have to get my hands on a copy of that book. Thank you for the suggestion! | |
Aug 30, 2013 at 15:15 | history | edited | caw | CC BY-SA 3.0 |
added 161 characters in body
|
Aug 30, 2013 at 10:27 | answer | added | Jernej | timeline score: 3 | |
Aug 30, 2013 at 9:38 | comment | added | Zsbán Ambrus | Have you checked Donald Knuth's TAOCP volume 4 for references yet? I think it covers similar problems, such as generating all trees. | |
Aug 30, 2013 at 3:03 | review | First posts | |||
Aug 30, 2013 at 3:46 | |||||
Aug 30, 2013 at 2:49 | history | edited | Ricardo Andrade |
edited tags
|
|
Aug 30, 2013 at 2:45 | history | asked | caw | CC BY-SA 3.0 |