Timeline for Cycle double covering of cubic graphs
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 4, 2012 at 2:59 | vote | accept | Hej | ||
| Jun 4, 2012 at 2:47 | history | edited | Gjergji Zaimi | CC BY-SA 3.0 |
added 274 characters in body
|
| Jun 4, 2012 at 2:03 | comment | added | Hej | Thanks Gjergji. So it follows that such a minimal graph $G$ admits a cycle covering so that every edge is covered exactly $2E-2$ times, where $E$ is the number of edges of $G$. Maybe there is a more trivial way of covering a graph with cycles that cover all edges the same number of times? Also do we know for example if there is a quadruple covering (or a number smaller than $2E-2$)? | |
| Jun 4, 2012 at 1:20 | history | answered | Gjergji Zaimi | CC BY-SA 3.0 |