Preprint
Sep 2026
Order 14 is the largest order for which every 4-total coloring of every cubic graph is equitable
A total coloring of a graph is an assignment of colors to its vertices and edges so that adjacent or incident elements receive distinct colors, and it is equitable when the cardinalities of any two color classes differ by at most one. Stemock conjectured that every $4$-total coloring of a cubic graph of order less than...
Matheus Adauto, C. D. de Figueiredo, Diana Sasaki et al.
· 0 citations