Liu–Zhang–Zhang conjecture on packing colorings of subcubic graphs
A packing -coloring of a graph is a partition of its vertex set into four classes whose pairwise vertex distances are respectively at least , , , and . Liu–Zhang–Zhang conjecture. Every connected subcubic graph except the Petersen graph is packing -colorable. The supplied text presents this as a stronger conjecture related to the subdivision conjecture, and the current status is not specified there.
References
- Xinmin Hou, Xujun Liu and Xiangyang Wang, “Every connected subcubic graph except the Petersen graph is packing (1,1,2,2)-colorable”, arXiv:2603.23434 (2026).
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.