betaFeedback

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 λ(G)λ(G) be the least kk for which labels from {0,…,k}\{0,\ldots,k\} 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 λ(G)≤708587λ(G)\le708587 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 q≥7q\ge7 diagonal colors, with an optimal uniform threshold. For cubic 3-connected plane graphs we obtain λ≤14λ\le14, improving to λ≤9λ\le9 in the bipartite case.

Paper details

vlnc:W_gjdjv38t
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 6

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…