arXiv · 2611.16649
On 2-Homogeneous Colourings of Cubic Bipartite Graphs
Abstract
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 $χ_h^{(2)}(G) = 3$, showing that every such graph admits a fall 3-colouring.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Rong-Xia Hao, Jianbing Liu, Federico Romaniello. 2026-11-12. On 2-Homogeneous Colourings of Cubic Bipartite Graphs. https://searcharxiv.com/abs/2611.16649
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.