Timeline for Total Coloring of even regular bipartite graphs
Current License: CC BY-SA 4.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 23, 2019 at 7:57 | comment | added | vidyarthi | I think the above construction works for $n=7$ also | |
| Jan 23, 2019 at 7:14 | comment | added | vidyarthi | great and thanks! But, now, this gives rise to another question. Whether we require $n$ to be a multiple of $42$(or $d(d+1)$) or anything lower is sufficient? | |
| Jan 23, 2019 at 0:35 | history | answered | Mike | CC BY-SA 4.0 |