Evans-type conjecture for cartesian products with
Evans-type conjecture for cartesian products with
Let be a graph, let be an integer, and write for the cartesian product of and the complete graph on two vertices. Write for the edge-chromatic number of . Evans-type conjecture for cartesian products with . If every precoloring of at most edges of can be extended to a proper -edge coloring, then every precoloring of at most edges of is extendable to a proper -edge coloring of . The paper verifies this conjecture for trees, complete and complete bipartite graphs, and graphs with small maximum degree, while giving partial results for general regular graphs; the general assertion remains open.
Sources & referencesView supporting material
Primary source
Carl Johan Casselgren, Fikre B. Petros and Samuel A. Fufa, “Extending partial edge colorings of cartesian products of graphs”, arXiv:2303.05507 (2023).
Additional references
2 papers in this index state this conjecture (2017–2023). The statement above is taken from the most recent of them; the others are arXiv:1711.01066.
Progress summary
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.