Timeline for Graphs constructed from sums of perfect matchings
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 14, 2022 at 17:39 | comment | added | Louis D | Related to my comment above. One way to decide if a graph can be constructed in this way is to first check whether the graph can be embedded into a k-regular multigraph. If not, then it cannot. If so, then are any of the k-regular multigraphs it can be embedded into 1-factorable? | |
| Mar 14, 2022 at 9:38 | history | edited | Aaron Meyerowitz | CC BY-SA 4.0 |
added 268 characters in body
|
| Mar 14, 2022 at 8:12 | history | edited | Aaron Meyerowitz | CC BY-SA 4.0 |
added 645 characters in body
|
| Mar 14, 2022 at 7:49 | history | answered | Aaron Meyerowitz | CC BY-SA 4.0 |