Wang's equitable total coloring conjecture
For a graph , let denote its maximum degree, and let denote its equitable total chromatic number, namely the least number of colors in an equitable total coloring of . Wang's equitable total coloring conjecture. For every graph ,
The source attributes this bound to Weifan Wang (2002) and gives no resolution in the supplied text, so it remains open.
References
- Bing Yao, Chao Yang, Xia Liu, Fei Ma, Jing Su, Hui Sun, Xiaohui Zhang and Yarong Mu, “Strings And Colorings Of Topological Coding Towards Asymmetric Topology Cryptography”, arXiv:2209.15312 (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.