A remark on the Petersen coloring conjecture of Jaeger

Abstract: If

G

and

H

are two cubic graphs, then we write

H p r e c G

, if

G

admits a proper edge-coloring

f

with edges of

H

, such that for each vertex

x

of

G

, there is a vertex

y

of

H

with

f (p a r t i a l_{G} (x)) = p a r t i a l_{H} (y)

. Let

P

and

S

be the Petersen graph and the Sylvester graph, respectively. In this paper, we introduce the Sylvester coloring conjecture. Moreover, we show that if

G

is a connected bridgeless cubic graph with

G p r e c P

, then

G = P

. Finally, if

G

is a connected cubic graph with

G p r e c S

, then

G = S

.

Recommendations

Cited In (13)

This page was built for publication: A remark on the Petersen coloring conjecture of Jaeger