Cubic Graph Generation is a project aimed at efficiently generating cubic graphs. The main objective was to implement an algorithm for enumerating prime cubic graphs using recursive calls, following ...
A Halin graph on n vertices and m edges is a graph that is planar, 3-connected, and has a face whose number of vertices equals m-n+1. A cubic graph is a graph with every vertex of degree 3. This ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results