Seven-color packing coloring conjecture for claw-free subcubic graphs

From papers

Let GG be a claw-free subcubic graph. Seven-color packing coloring conjecture. The graph GG is (2,2,2,2,2,2,2)(2,2,2,2,2,2,2)-packing colorable. The paper gives related packing-coloring results for claw-free subcubic graphs, but does not establish this seven-color assertion; it remains open.

Progress summary

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

Sources & referencesView supporting material

Primary source

Ayman El Zein and Maidoun Mortada, “Impact of local girth on the S-packing coloring of k-saturated subcubic graphs”, arXiv:2603.25113 (2026).

Solutions 0

No solutions have been posted yet.