A remark on Petersen coloring conjecture of Jaeger

Details A remark on Petersen coloring conjecture of Jaeger A remark on Petersen coloring conjecture of Jaeger

2012-01-21

arxiv.org/abs/1201.4472v1

Computer Science

Discrete Mathematics

5 pages, 1 figure

Scientific paper

If $G$ and $H$ are two cubic graphs, then we write $G\prec H$, 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(N_G(x))=N_H(y)$. Let $P$ be the
Petersen graph. In this paper, we show that if $G$ is a connected bridgeless
cubic graph with $P\prec G$, then $G=P$.

Affiliated with

Also associated with

No associations

Rating

A remark on Petersen coloring conjecture of Jaeger does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A remark on Petersen coloring conjecture of Jaeger, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A remark on Petersen coloring conjecture of Jaeger will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-134948