Timeline for Cycle of length 4 in an undirected graph
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 5, 2017 at 10:54 | comment | added | Vijayender | A graph can have a cycle of length 4 and yet densely connected (shortest distance between any two nodes is 1). In such a scenario the algorithm above would yield nothing. | |
| Jun 17, 2011 at 14:11 | history | edited | gowers | CC BY-SA 3.0 |
corrected spelling of "mentioned"
|
| Jun 16, 2011 at 16:38 | comment | added | user15816 | I guess that's what I was looking for. Thank you! | |
| Jun 16, 2011 at 16:38 | vote | accept | user15816 | ||
| Jun 16, 2011 at 16:23 | history | answered | Nathann Cohen | CC BY-SA 3.0 |