Timeline for What's the name of graphs with each vertex contained in a cycle?
Current License: CC BY-SA 2.5
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 15 at 16:21 | comment | added | feire | I am so silly, but why a minimum degree of 2 is required? | |
| Jan 11, 2010 at 1:45 | history | edited | Harrison Brown | CC BY-SA 2.5 |
added 618 characters in body
|
| Jan 11, 2010 at 1:24 | comment | added | Hans-Peter Stricker | Sorry for my part, I should have understood it this way. (You treat the one counter-example of David below - the 8-graph - and we are done?) | |
| Jan 11, 2010 at 1:16 | comment | added | Harrison Brown | Sorry, I meant adjacent in the original graph. | |
| Jan 11, 2010 at 1:10 | comment | added | Hans-Peter Stricker | How can vertices of G-v be adjacent to v? | |
| Jan 11, 2010 at 1:07 | comment | added | Hans-Peter Stricker | Thanks. Please see my comments to David's answer. They apply also to yours. | |
| Jan 11, 2010 at 1:04 | history | answered | Harrison Brown | CC BY-SA 2.5 |