Extending partial edge-colorings of bounded size in Cartesian products of graphs

TL;DR

This paper investigates conditions under which partial edge-colorings of Cartesian product graphs can be extended to proper colorings, providing progress on a conjecture for specific graph classes.

Contribution

It offers partial proofs of a conjecture on edge-precoloring extensions in Cartesian products, focusing on triangle-free, regular, and subcubic graphs with various factors.

Findings

Established extension results for triangle-free r-regular graphs with star, cycle, or tree factors.

Proved the conjecture for subcubic graphs when H is K2.

Progressed toward a general hypothesis on edge-precoloring extensions in Cartesian products.

Abstract

This paper studies edge-precoloring extensions in Cartesian products of graphs, motivated by a conjecture of Casselgren, Petros, and Fufa. We formulate a general hypothesis stating that if every edge-precoloring of $G$ and $H$ of sizes $k<\chi'(G)$ and $l<\chi'(H)$, respectively, is extendable, then any edge-precoloring of $G \square H$ of size $k+l+1$ can be extended to a proper $(\chi'(G)+\chi'(H))$-coloring. We provide partial progress toward this conjecture by establishing the result in cases where $k<\Delta(G)$, $G$ is a triangle-free $r$-regular graph and $H$ is a star, an even cycle, a path or, more generally, an arbitrary tree $F$. Furthermore, we prove the conjecture in the case where $G$ is a subcubic graph and $H = K_2$.