Work

On 2-Homogeneous Colourings of Cubic Bipartite Graphs

Year: 2026
Type: preprint
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.
Language: English
Open Access status: green
OpenAlex ID: W7226033641
Cites: 3
Cited by:
Related to: 10