Answers are grounded in this paper and cite their sources.
A proper vertex colouring is 2-homogeneous if every open neighbourhood contains exactly two colours. We show that every cubic bipartite graph admits a 2-homogeneous colouring with at most four colours, proving a conjecture of Janicová, Madaras, Soták and Lužar. For 3-connected det-extremal cubic bipartite graphs, we establish the stronger bound χₕ⁽²⁾(G) = 3, showing that every such graph admits a fall 3-colouring.
No takes yet. Share an insight, caveat, or question.
Hao et al. (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: