Open Problem Garden
Help
About
Contact
login/create account
Home
»
Keyword index
edge-coloring
Graph Theory
»
Coloring
»
Edge coloring
Petersen coloring conjecture
★★★
Author(s):
Jaeger
Conjecture
Let
be a
cubic
graph with no
bridge
. Then there is a coloring of the edges of
using the edges of the
Petersen
graph so that any three mutually adjacent edges of
map to three mutually adjancent edges in the Petersen graph.
Keywords:
cubic
;
edge-coloring
;
Petersen graph
Posted by
mdevos
updated November 24th, 2011
2 comments
« first
‹ previous
1
2
Navigate
Subject
Algebra
(7)
Analysis
(5)
Combinatorics
(35)
Geometry
(29)
Graph Theory
(228)
Group Theory
(5)
Logic
(10)
Number Theory
(49)
PDEs
(0)
Probability
(1)
Theoretical Comp. Sci.
(13)
Topology
(40)
Unsorted
(1)
Author index
Keyword index
more
Recent Activity
Chords of longest cycles
Do any three longest paths in a connected graph have a vertex in common?
Chromatic number of $\frac{3}{3}$-power of graph
3-Edge-Coloring Conjecture
r-regular graphs are not uniquely hamiltonian.
more