Timeline for Generating 21-vertex 4-regular plane graphs with 8 faces of degree 3 and 15 faces of degree 4
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 22, 2023 at 3:43 | vote | accept | Xin Zhang | ||
| Dec 20, 2023 at 12:52 | comment | added | Brendan McKay | @XinZhang If the theory says that the graph is 4-edge-connected and simple (no multiple edges), or you don't want multiple edges, the quickest command is plantri -q -g -c2 23 which makes the duals. Filter through pickg as Gordon says. Or you can get the duals directly with "plantri -q -g -c2 -d 23 | pickg -T8". If you get serious about larger sizes, the optimal path is to add a filter inside plantri to remove the graphs with the wrong degrees. There are hooks for such purpose but they aren't so easy to use. | |
| Dec 20, 2023 at 6:26 | history | edited | Gordon Royle | CC BY-SA 4.0 |
Added computation details
|
| Dec 19, 2023 at 3:05 | comment | added | Xin Zhang | Actually if such a graph exists then it shall be 4-edge-connected by a known result. I used plantri but it takes a couple of hours. Maybe I had some thing wrong while using plantri. I just commanded plantri 23 -p -m4 -e46 -f4 . So what is the correct command for the program? If possible, can you return me the output graphs here, either in -a or -T form. Thanks. | |
| Dec 18, 2023 at 10:50 | comment | added | Brendan McKay | 23 if the 3-connected ones are all you need. Perhaps more if you allow lower connectivity or multiple edges. | |
| Dec 18, 2023 at 10:03 | history | answered | Gordon Royle | CC BY-SA 4.0 |