On a conjecture of Keedwell and the cycle double cover conjecture (Q1567293)

Let \(S = \{ s_1, \dots, s_m, t_1, \dots, t_n \}\) be a positive integer sequence. The sequence \(S\) is called a bipartite graphic sequence if there is a bipartite graph \(G\) with bipartition \(\{ X, Y \}\) such that \(\{ d(x_1), \dots, d(x_m) \} = \{ s_1, \dots, s_m \},\) and \(\{ d(y_1), \dots, d(y_n) \} = \{ t_1, \dots, t_n \}\) where \(X = \{ x_1, \dots, x_m \} \) and \(Y = \{ y_1, \dots, y_n \}\) and \(d(v)\) is the degree of vertex \(v\); the graph \(G\) is called a realization of \(S\). It was conjectured by Keedwell (1993) and reproposed by Cameron (1999) that every bipartite graphic sequence \(S\) with minimum degree \(\delta(S) \geq 2\) has a realization \(G\) of \(S\) such that \(G\) has two proper edge-colorings with the following properties: (1) for any vertex, the set of colors appearing on edges at that vertex are the same in both colorings; (2) no edge receives the same color in both colorings. The conjecture was originally motivated by studies of critical partial Latin squares (Keedwell 1993). It is proved in this paper that the conjecture is true for the following families of bipartite graphic sequences \(S\): (1) with at most \(29\) edges; or (2) \(S\) is semieulerian. It is also proved that the Keedwell-Cameron conjecture is implied by the orientable circuit double cover conjecture. Note that the Keedwell-Cameron conjecture was solved by Luo, Zang and the reviewer recently.