Timeline for Efficient way to get all $k$-factors of a graph $G$?
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 25, 2021 at 8:57 | vote | accept | Xuemei | ||
| Jul 24, 2021 at 14:47 | comment | added | bRost03 | @Xuemei Correct | |
| Jul 24, 2021 at 14:37 | comment | added | Xuemei | the condition n is the number of vertex, right? | |
| Jul 24, 2021 at 11:31 | comment | added | bRost03 | Yes, that condition is from the fact that your $k$-factor is $k$-regular and has nothing to do with the underlying graph | |
| Jul 24, 2021 at 7:59 | comment | added | Xuemei | just one question, will the method ( i.e. Subsets[edgeslist, {k n/2}]]) work for non-complete graph such as PetersenGraph[5,1] (although many vertices but few edges)? @bRost03 | |
| Jul 23, 2021 at 23:01 | history | edited | bRost03 | CC BY-SA 4.0 | added 147 characters in body |
| Jul 23, 2021 at 16:20 | comment | added | Xuemei | thank you very much! It's a really good point that one can reduce the Subsets with some conditions. | |
| Jul 23, 2021 at 16:17 | history | answered | bRost03 | CC BY-SA 4.0 |