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

An embedding of a graph G in some surface is said to be polyhedral if every facial boundary is a cycle in the graph and any two distinct faces share at most a vertex or an edge in their boundaries. It ...