Brualdi–Quinn Massey's strong chromatic index conjecture for bipartite graphs
Let be an -bipartite graph, meaning that the two vertex classes of have maximum degrees at most and , respectively. Brualdi–Quinn Massey's conjecture. The strong chromatic index satisfies
This conjecture refines the earlier conjecture of Faudree, Gyárfás, Schelp, and Tuza that every bipartite graph satisfies . Its status is not specified in the supplied text.
References
Primary source
Weichan Liu and Guiying Yan, “Hypergraph incidence coloring”, arXiv:2202.02770 (2022).
Additional references
6 papers in this index state this conjecture (2013–2022). The statement above is taken from the most recent of them; the others are arXiv:1808.01214, arXiv:1806.07017, arXiv:1804.06036, arXiv:1412.2624, arXiv:1311.6668.
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
No solutions have been posted yet.