On consecutive labeling of plane graphs (Q2639075)

Confining the concept of a magic graph to plane graphs by including the labeling of faces, the author considers a magic vertex labeling and a so- called consecutive labeling of type (0,1,1) of a special plane graph \(P_{m,n}\), \(m\geq 1,\quad n=2k\geq 4,\quad n\neq 6,\) consisting of both n- sided faces and \(m\cdot n/2\) interior 6-sided faces. Combining the two labelings mentioned above, the author constructs a so-called consecutive labeling of type (1,1,1) of \(P_{m,n}\).