Borowiecki–Jozef Cartesian product list-coloring conjecture
Borowiecki–Jozef Cartesian product list-coloring conjecture
For graphs and , their Cartesian product has vertex set , with adjacent to when either and or and . Borowiecki–Jozef's conjecture. For every pair of graphs and , there exists a constant such that
The paper presents this as one of two conjectures on Cartesian products and gives no resolution.
Sources & referencesView supporting material
Primary source
Nandana K Vasudevan, K Somasundaram and N Narayanan, “List-Coloring and Chromatic-Choosability – A Dynamic Survey”, arXiv:2606.31702 (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
Sign in to submit a solution.
No solutions have been posted yet.