On the existence of graphs which can colour every regular graph

Abstract: Let

H

and

G

be graphs. An

H

-colouring of

G

is a proper edge-colouring

f : E (G) i g h t a r r o w E (H)

such that for any vertex

u i n V (G)

there exists a vertex

v i n V (H)

with

f l e f t (p a r t i a l_{G} u i g h t) = p a r t i a l_{H} v

, where

p a r t i a l_{G} u

and

p a r t i a l_{H} v

respectively denote the sets of edges in

G

and

H

incident to the vertices

u

and

v

. If

G

admits an

H

-colouring we say that

H

colours

G

. The question whether there exists a graph

H

that colours every bridgeless cubic graph is addressed directly by the Petersen Colouring Conjecture, which states that the Petersen graph colours every bridgeless cubic graph. In 2012, Mkrtchyan showed that if this conjecture is true, the Petersen graph is the unique connected bridgeless cubic graph

H

which can colour all bridgeless cubic graphs. In this paper we extend this and show that if we were to remove all degree conditions on

H

, every bridgeless cubic graph

G

can be coloured substantially only by a unique other graph: the subcubic multigraph

S_{4}

on four vertices. A few similar results are provided also under weaker assumptions on the graph

G

. In the second part of the paper, we also consider

H

-colourings of regular graphs having degree strictly greater than

3

and show that: (i) for any

r > 3

, there does not exist a connected graph

H

(possibly containing parallel edges) that colours every

r

-regular multigraph, and (ii) for every

r > 1

, there does not exist a connected graph

H

(possibly containing parallel edges) that colours every

2 r

-regular simple graph.

Recommendations

Cites work

Cited in

(9)

This page was built for publication: On the existence of graphs which can colour every regular graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6162043)