Timeline for Is there any partition of a regular graph which in any part there exists a vertex with all its neighborhood?
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 12, 2014 at 21:18 | answer | added | user50739 | timeline score: 0 | |
| May 11, 2014 at 0:46 | comment | added | Brendan McKay | Oh, you want each part to consist of a vertex and its neighbours, not just that it contains a vertex and its neighbours. | |
| May 10, 2014 at 15:25 | answer | added | Chris Godsil | timeline score: 6 | |
| May 10, 2014 at 14:51 | comment | added | user50655 | I want to partition whole of the graph in this way. I mean, make a partition, in every part put a vertex with all its neighborhood, so in each part there exist exactly r vertices, where my graph is r_regular. | |
| May 10, 2014 at 14:36 | comment | added | Brendan McKay | I find this question too imprecise to be interesting. How many parts do you want? There is such a partition into two parts iff the diameter is greater then 2. | |
| May 10, 2014 at 14:15 | answer | added | joro | timeline score: 2 | |
| May 10, 2014 at 13:13 | review | First posts | |||
| May 10, 2014 at 13:44 | |||||
| May 10, 2014 at 12:56 | history | asked | user50655 | CC BY-SA 3.0 |