Timeline for the length of cycles in a $2$-connected simple gragh
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 7, 2013 at 14:15 | vote | accept | user40096 | ||
| Oct 22, 2013 at 0:31 | comment | added | user40096 | Hello,Tony Huynh,I want to proof the simplest case:$C$ is $2n$-cycle and there are $n$ ears on $C$ in all such that (as you said)every ear is a $C$-path with two edges and every two ears do not have common vertex.So every vertex of $C$ is a end of an ear.But I can not proof it or give a counterexample. | |
| Oct 19, 2013 at 6:02 | comment | added | user40096 | Tony Huynh,Thank you for your help!But I can not go any futher!I am still thinking about it. | |
| Oct 16, 2013 at 16:52 | history | edited | Tony Huynh | CC BY-SA 3.0 |
added 7 characters in body
|
| Oct 16, 2013 at 16:44 | history | answered | Tony Huynh | CC BY-SA 3.0 |