Timeline for Regular graphs with $a$ and $b$ Hamiltonian edges
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:58 | history | edited | CommunityBot |
replaced http://mathoverflow.net/ with https://mathoverflow.net/
|
|
| Jan 10, 2014 at 10:21 | vote | accept | joro | ||
| Jan 5, 2014 at 16:54 | comment | added | Wolfgang | I see you dropped the 3-connectedness. Your example is only 2-connected. Take the H-cycle 1 5 7 11 3 9 0 4 8 6 2 10 and you'll see that (2,9) or (3,10) are cutting edges. I haven't checked the connectedness of your gadgets below, though. | |
| Dec 29, 2013 at 15:27 | answer | added | joro | timeline score: 2 | |
| Dec 27, 2013 at 14:41 | comment | added | nvcleemp | Just as a confirmation: there is exactly one 4-regular graph $G$ on 12 vertices with $\rho(G)=1$. No 4-regular graphs on less vertices has $\rho$ equal to 1. | |
| Dec 27, 2013 at 14:21 | history | asked | joro | CC BY-SA 3.0 |