Abstract
At the 16th British Combinatorial Conference (1997), Cameron introduced a new concept called 2-simultaneous edge-coloring and conjectured that every bipartite graphic sequence, with all degrees at least 2, has a 2-simultaneous edge-colorable realization. In fact, this conjecture is a reformulation of a conjecture of Keedwell (Graph Theory, Combinatorics, Algorithms and Applications, Proceedings of Third China–USA International Conference, Beijing, June 1–5, 1993, World Scientific Publ. Co., Singapore, 1994, pp. 111–124) on the existence of critical partial latin squares (CPLS) of a given type. In this paper, using some classical results about nowhere-zero 4-flows and oriented cycle double covers, we prove that this conjecture is true for all bipartite graphic sequences with all degrees at least 4.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
