Timeline for Name the class of graphs G s.t. every two graphs that can be created by removing one edge from G are isomorphic.
Current License: CC BY-SA 2.5
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 17, 2010 at 22:48 | comment | added | Gerry Myerson | I don't know. Apparently in the infinite case there examples that are not edge-transitive, but OP has clarified that only finite graphs are of interest, and no one has posted such an example (yet). I'm not a graph-theorist, I just play one in the classroom. | |
| Oct 17, 2010 at 11:21 | history | answered | Bhalchandra D Thatte | CC BY-SA 2.5 |