Timeline for Counting simple 4-cycles in an undirected graph
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 11, 2022 at 16:34 | comment | added | Ganesh Chowdhary Sadanala | Got it, THanks! | |
| Oct 11, 2022 at 5:48 | comment | added | David Eppstein | You need to also prevent the same cycle from being found from the pair (uy,xv). That's what the second check is for. | |
| Sep 1, 2022 at 3:18 | comment | added | Ganesh Chowdhary Sadanala | I think only the first condition is enough i.e; 𝑢 has the minimum index among all four vertices. It can be proved by contradiction method. | |
| Jan 19, 2014 at 4:06 | history | answered | David Eppstein | CC BY-SA 3.0 |