Table of Contents
Fetching ...

Star colouring and locally constrained graph homomorphisms

Cyriac Antony, Shalu M. A

TL;DR

This work advances the understanding of star colourings in even-degree regular graphs by embedding them in a framework of locally constrained graph homomorphisms to oriented line graphs. It introduces LBH and OBH as driving concepts and leverages the oriented line graph operation $\vec{L}(\cdot)$ and its undirected counterpart $L^*(\cdot)$ to connect colouring, orientation, and lifting properties. For $p\ge 2$, it proves that a $K_{1,p+1}$-free $2p$-regular graph is $(p+2)$-star colourable if and only if it admits a locally bijective homomorphism to $L^*(K_{p+2})$ and equivalently an orientation with an OBH to $\vec{L}(K_{p+2})$, yielding eigenvalue consequences and providing both structural and complexity results (e.g., NP-completeness in planar cases and a characterization for line graphs of 3-regular graphs). The paper also outlines several open problems and future directions, including broader classifications of $(2p-1)$-regular cases and the spectrum of $L^*(G)$, highlighting the practical impact on graph colouring, spectral theory, and algorithmic complexity within graph theory.

Abstract

We relate star colouring of even-degree regular graphs to the notions of locally constrained graph homomorphisms to the oriented line graph $ \vec{L}(K_q) $ of the complete graph $ K_q $ and to its underlying undirected graph $ 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) $ is a 2-lift of the line graph $ L(H) $ for every graph $ H $. Dvořák, Mohar and Šámal (J. Graph Theory, 2013) proved that for every 3-regular graph $ G $, the line graph of $ G $ is 4-star colourable if and only if $ G $ admits a locally bijective homomorphism to the cube $ Q_3 $. We generalise this result as follows: for $ p\geq 2 $, a $ K_{1,p+1} $-free $ 2p $-regular graph $ G $ admits a $ (p+2) $-star colouring if and only if $ G $ admits a locally bijective homomorphism to $ L^*(K_{p+2}) $. As a result, if a $ K_{p+1} $-free $ 2p $-regular graph $ G $ with $ p\geq 2 $ is $ (p+2) $-star colourable, then $ -2 $ and $ p-2 $ are eigenvalues of $ G $. We also prove the following: (i) for $ p\geq 2 $, a $ 2p $-regular graph $ G $ admits a $ (p+2) $-star colouring if and only if $ G $ has an orientation that admits an out-neighbourhood bijective homomorphism to $ \vec{L}(K_{p+2}) $; (ii) the line graph of a 3-regular graph $ G $ is 4-star colourable if and only if $ 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.

Star colouring and locally constrained graph homomorphisms

TL;DR

This work advances the understanding of star colourings in even-degree regular graphs by embedding them in a framework of locally constrained graph homomorphisms to oriented line graphs. It introduces LBH and OBH as driving concepts and leverages the oriented line graph operation and its undirected counterpart to connect colouring, orientation, and lifting properties. For , it proves that a -free -regular graph is -star colourable if and only if it admits a locally bijective homomorphism to and equivalently an orientation with an OBH to , yielding eigenvalue consequences and providing both structural and complexity results (e.g., NP-completeness in planar cases and a characterization for line graphs of 3-regular graphs). The paper also outlines several open problems and future directions, including broader classifications of -regular cases and the spectrum of , highlighting the practical impact on graph colouring, spectral theory, and algorithmic complexity within graph theory.

Abstract

We relate star colouring of even-degree regular graphs to the notions of locally constrained graph homomorphisms to the oriented line graph of the complete graph and to its underlying undirected graph . Our results have consequences for locally constrained graph homomorphisms and oriented line graphs in addition to star colouring. We show that is a 2-lift of the line graph for every graph . Dvořák, Mohar and Šámal (J. Graph Theory, 2013) proved that for every 3-regular graph , the line graph of is 4-star colourable if and only if admits a locally bijective homomorphism to the cube . We generalise this result as follows: for , a -free -regular graph admits a -star colouring if and only if admits a locally bijective homomorphism to . As a result, if a -free -regular graph with is -star colourable, then and are eigenvalues of . We also prove the following: (i) for , a -regular graph admits a -star colouring if and only if has an orientation that admits an out-neighbourhood bijective homomorphism to ; (ii) the line graph of a 3-regular graph is 4-star colourable if and only if 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.
Paper Structure (14 sections, 34 theorems, 7 figures)

This paper contains 14 sections, 34 theorems, 7 figures.

Key Result

Theorem 1

For every graph $H$, there is an LBH from $L^*(H)$ to $L(H)$.

Figures (7)

  • Figure 1: A locally bijective homomorphism from a graph $G$ to a graph $H$. The vertices in $H$ are labelled distinct and are drawn by distinct shapes. For each vertex $w$ of $H$, each copy of $w$ in $G$ is drawn in the same shape as $w$ (and labelled the same).
  • Figure 2: An out-neighbourhood bijective homomorphism from an oriented graph $\vec{G}$ to an oriented graph $\vec{H}$. The vertices in $\vec{H}$ are labelled distinct and are drawn by distinct shapes. For each vertex $w$ of $\vec{H}$, each copy of $w$ in $\vec{G}$ is drawn in the same shape as $w$ (and labelled the same).
  • Figure 3: A 4-coloured MINI-orientation of $L(Q_3)$ (the cuboctahedral graph).
  • Figure 4: An example of the oriented line graph operation.
  • Figure 5: Possible orientations of a $C_4$ in a coloured MINI-orientation of $G$.
  • ...and 2 more figures

Theorems & Definitions (61)

  • proof
  • Theorem 1
  • proof
  • Lemma 1
  • proof
  • Claim 1
  • Lemma 2
  • proof
  • Claim 1
  • Claim 2
  • ...and 51 more