Baudon's neighbor full sum distinguishing total coloring conjecture

About 4 years old · traced to

Let GG be a nice graph and let w:V(G)∪E(G)→{1,2,…,k}w:V(G)\cup E(G)\rightarrow\{1,2,\ldots,k\} be a total integer weighting. For each vertex vv, define

σven(v):=w(v)+∑e∋vw(e)+∑u∈N(v)w(u),\sigma^{ven}(v):=w(v)+\sum_{e\ni v}w(e)+\sum_{u\in N(v)}w(u),

where N(v)N(v) is the open neighborhood of vv. The weighting is a neighbor full sum distinguishing total coloring when adjacent vertices receive distinct values of σven\sigma^{ven}, and χven(G)\chi^{ven}(G) is the least such kk. Baudon's conjecture. For every nice graph GG, χven(G)≤3\chi^{ven}(G)\leq 3. This extends total neighbor sum distinguishing colorings by also including the weights of neighboring vertices. The source presents the assertion as open.

References

Primary source

Akbar Davoodi and Leila Maherani, “On the total versions of 1-2-3-conjecture for graphs and hypergraphs”, arXiv:2204.13936 (2022).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.