Baudon's neighbor full sum distinguishing total coloring conjecture
Baudon's neighbor full sum distinguishing total coloring conjecture
Let be a nice graph and let be a total integer weighting. For each vertex , define
where is the open neighborhood of . The weighting is a neighbor full sum distinguishing total coloring when adjacent vertices receive distinct values of , and is the least such . Baudon's conjecture. For every nice graph , . This extends total neighbor sum distinguishing colorings by also including the weights of neighboring vertices. The source presents the assertion as open.
Sources & referencesView supporting material
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
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.