The local antimagic chromatic number of generalized book graphs

Let GB(a1,a2,,ar)GB(a_1,a_2,\ldots,a_r) denote the generalized book graph obtained by edge-gluing cycles of orders a1,a2,,ara_1,a_2,\ldots,a_r, where a1a2ar3a_1\ge a_2\ge \cdots\ge a_r\ge 3 and r2r\ge 2. Let χla(G)\chi_{la}(G) denote the local antimagic chromatic number of a graph GG. The generalized book graph conjecture. If a14a_1\ge 4, then

χla(GB(a1,a2,,ar))=4.\chi_{la}(GB(a_1,a_2,\ldots,a_r))=4.

The claim concerns the non-triangular generalized book graphs; the paper proves the corresponding value 33 for GB(3[r])GB(3^{[r]}) and notes that a 44-coloring is easy to obtain in the remaining case. The parser supplies no evidence that this statement is resolved, so its status is left open.

Sources & referencesView supporting material

Primary source

Gee-Choon Lau, Wai-Chee Shiu and Ho-Kuen Ng, “On local antimagic chromatic number of graphs with cut-vertices”, arXiv:1805.04801 (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.