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 ...

Cubic graphs – those regular graphs in which every vertex has degree three – remain a fertile area of research in both combinatorics and theoretical computer science. These graphs are not only central ...