A graph is said to be \(k\)-covered if for each edge \(xy\), \(deg(x) = k\) or \(deg(y) = k\). In this paper, we characterize the \(3\)-covered quadrangulations of closed surfaces.
Citation
Kiyoshi Ando, Atsuhiro Nakamoto. On Quadrangulations of Closed Surfaces Covered by Vertices of Degree \(3\)[J], Ars Combinatoria, Volume 062. 121-127. .