Casselgren–Petrosyan conjecture for outerplanar graphs

About 3 years old · traced to

Let GG be an outerplanar graph, and let μint⁡(G)\mu_{\operatorname{int}}(G) denote its interval coloring impropriety. Casselgren–Petrosyan's outerplanar graph conjecture.

μint⁡(G)≤2.\mu_{\operatorname{int}}(G) \leq 2.

This would improve the known bound μint⁡(G)≤⌈Δ(G)/4⌉+1\mu_{\operatorname{int}}(G)\leq \left\lceil \Delta(G)/4\right\rceil+1. The source states that the conjecture has been proved when Δ(G)≤8\Delta(G)\leq 8, but leaves the general case unresolved.

References

Primary source

MacKenzie Carr, Eun-Kyung Cho, Nicholas Crawford, Vesna Iršič, Leilani Pai and Rebecca Robinson, “On the interval coloring impropriety of graphs”, arXiv:2312.14881 (2024).

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.