On 2-Homogeneous Colourings of Cubic Bipartite Graphs
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.
Authors
- Federico Romaniello (ORCID: https://orcid.org/0000-0003-1166-3179)
- Rong‐Xia Hao (ORCID: https://orcid.org/0000-0001-8714-8750)
- Jianbing Liu
Publication Details
- Journal
- arXiv (Cornell University)
- Published
- 2026-11-12
- DOI
- https://doi.org/10.48550/arxiv.2611.16649
- Primary Topic
- Graph Labeling and Dimension Problems
- Type
- preprint