English

Star colouring and locally constrained graph homomorphisms

Combinatorics 2025-05-08 v3 Discrete Mathematics

Abstract

We relate star colouring of even-degree regular graphs to the notions of locally constrained graph homomorphisms to the oriented line graph L(Kq) \vec{L}(K_q) of the complete graph Kq K_q and to its underlying undirected graph L(Kq) L^*(K_q) . Our results have consequences for locally constrained graph homomorphisms and oriented line graphs in addition to star colouring. We show that L(H) L^*(H) is a 2-lift of the line graph L(H) L(H) for every graph H H . Dvo\v{r}\'ak, Mohar and \v{S}\'amal (J. Graph Theory, 2013) proved that for every 3-regular graph G G , the line graph of G G is 4-star colourable if and only if G G admits a locally bijective homomorphism to the cube Q3 Q_3 . We generalise this result as follows: for p2 p\geq 2 , a K1,p+1 K_{1,p+1} -free 2p 2p -regular graph G G admits a (p+2) (p+2) -star colouring if and only if G G admits a locally bijective homomorphism to L(Kp+2) L^*(K_{p+2}) . As a result, if a Kp+1 K_{p+1} -free 2p 2p -regular graph G G with p2 p\geq 2 is (p+2) (p+2) -star colourable, then 2 -2 and p2 p-2 are eigenvalues of G G . We also prove the following: (i) for p2 p\geq 2 , a 2p 2p -regular graph G G admits a (p+2) (p+2) -star colouring if and only if G G has an orientation that admits an out-neighbourhood bijective homomorphism to L(Kp+2) \vec{L}(K_{p+2}) ; (ii) the line graph of a 3-regular graph G G is 4-star colourable if and only if G G is bipartite and distance-two 4-colourable; and (iii) it is NP-complete to check whether a planar 4-regular 3-connected graph is 4-star colourable.

Keywords

Cite

@article{arxiv.2312.00086,
  title  = {Star colouring and locally constrained graph homomorphisms},
  author = {Cyriac Antony and Shalu M. A},
  journal= {arXiv preprint arXiv:2312.00086},
  year   = {2025}
}

Comments

The only change from v2 is correcting Figure 4

R2 v1 2026-06-28T13:37:36.869Z