WorksMathematics
From Diagonal Coloring to Proper Vertex Labelings Distinguishing Adjacent Facial Sums
Abstract
In this paper we study proper vertex labelings of 3-connected plane graphs that give distinct boundary-vertex sums to faces sharing an edge. Let be the least for which labels from suffice, and let \laml(G) be its arbitrary-real-list counterpart. Our two main results are an eight-element list theorem for fullerenes and the universal bound for all 3-connected plane graphs. We establish structural nine- and eight-color bounds, classify triangulations whose vertices of degree at least five form an independent set, and determine their exact diagonal chromatic numbers. We also prove closure under triangular sums for diagonal colors, with an optimal uniform threshold. For cubic 3-connected plane graphs we obtain , improving to in the bipartite case.