Cyclic Edge Connectivity of Cubic Graphs

[MeikeWeiss]

In a project, a student developed a GAP program that calculates the cyclic edge connectivity of a given cubic graph in O(n^2*log^2(n)) time for n the number of vertices, based on a paper. Would you be interested in including this method in your package, even though it is only applicable to specific types of graphs?

[james-d-mitchell]

@MeikeWeiss Yes absolutely we'd value that contribution very much!

[mtorpey]

@MeikeWeiss - is this something you're thinking you might implement, or are you looking for help doing it? :)

[MeikeWeiss]

@mtorpey A student has already implemented this method, I just need to find the time to make a pull request. I will do this at the next GAP Days at the latest :)

[mtorpey]

Excellent. Thanks a lot!