← All problems

Gastineau–Togni conjecture on packing colorings of subcubic graphs

6 years old · traced to

A packing (1,1,2,3)(1,1,2,3)-coloring is a partition of the vertex set into four classes whose pairwise vertex distances are respectively at least 22, 22, 33, and 44. Gastineau–Togni conjecture. Every connected subcubic graph except the Petersen graph is packing (1,1,2,3)(1,1,2,3)-colorable. The paper says that this was posed as a conjecture because the authors believe it is true; no resolution is supplied in the candidate context.

References

4 papers in this index state this conjecture (2020–2026). The statement above is taken from the most recent of them; the others are arXiv:2502.16962, arXiv:2206.15046, arXiv:2011.02175.

Source: 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.