2 research outputs found
A remark on Petersen coloring conjecture of Jaeger
If and are two cubic graphs, then we write , if admits
a proper edge-coloring with edges of , such that for each vertex of
, there is a vertex of with . Let
and be the Petersen graph and the Sylvester graph, respectively. In
this paper, we introduce the Sylvester coloring conjecture. Moreover, we show
that if is a connected bridgeless cubic graph with , then .
Finally, if is a connected cubic graph with , then .Comment: 6 pages, 2 figures, + the comments of the referees are taken into
account+ Sylvester coloring conjecture is introduced+ a result related with
this conjectures is prove
On Sylvester Colorings of Cubic Graphs
If and are two cubic graphs, then an -coloring of is a proper
edge-coloring with edges of , such that for each vertex of ,
there is a vertex of with . If
admits an -coloring, then we will write . The Petersen coloring
conjecture of Jaeger states that for any bridgeless cubic graph , one has:
. The second author has recently introduced the Sylvester coloring
conjecture, which states that for any cubic graph one has: . Here
is the Sylvester graph on vertices. In this paper, we prove the
analogue of Sylvester coloring conjecture for cubic pseudo-graphs. Moreover, we
show that if is any connected simple cubic graph with , then
. This implies that the Petersen graph does not admit an
-coloring, where is the smallest connected simple cubic graph
without a perfect matching. has vertices. %We conjecture that
there are infinitely many connected cubic simple graphs which do not admit an
%-coloring. Finally, we obtain results towards the Sylvester
coloring conjecture. The first result states that any cubic graph has a
coloring with edges of Sylvester graph such that at least of
vertices of meet the conditions of Sylvester coloring conjecture. The
second result states that any claw-free cubic graph graph admits an
-coloring. This results is an application of our result on cubic
pseudo-graphs.Comment: 18 pages, 14 figure