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.

Conjecture   Every bridgeless graph with no Petersen minor has a nowhere-zero 4-flow.